[Boost-commit] svn:boost r62008 - in website/public_html/live/doc/libs: . 1_43_0 1_43_0/libs 1_43_0/libs/range 1_43_0/libs/range/doc 1_43_0/libs/range/doc/html 1_43_0/libs/range/doc/html/range 1_43_0/libs/range/doc/html/range/concepts 1_43_0/libs/range/doc/html/range/library_headers 1_43_0/libs/range/doc/html/range/mfc_atl 1_43_0/libs/range/doc/html/range/reference 1_43_0/libs/range/doc/html/range/reference/adaptors 1_43_0/libs/range/doc/html/range/reference/adaptors/reference 1_43_0/libs/range/doc/html/range/reference/algorithms 1_43_0/libs/range/doc/html/range/reference/algorithms/heap 1_43_0/libs/range/doc/html/range/reference/algorithms/mutating 1_43_0/libs/range/doc/html/range/reference/algorithms/new 1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating 1_43_0/libs/range/doc/html/range/reference/algorithms/numeric 1_43_0/libs/range/doc/html/range/reference/algorithms/permutation 1_43_0/libs/range/doc/html/range/reference/algorithms/set 1_43_0/libs/range/doc/html/range/reference/concept_implementation 1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics 1_43_0/libs/range/doc/html/range/reference/extending 1_43_0/libs/range/doc/html/range/reference/extending/method_3 1_43_0/libs/range/doc/html/range/reference/ranges 1_43_0/libs/range/doc/html/range/reference/utilities 1_43_0/libs/range/doc/html/range/upgrade

Subject: [Boost-commit] svn:boost r62008 - in website/public_html/live/doc/libs: . 1_43_0 1_43_0/libs 1_43_0/libs/range 1_43_0/libs/range/doc 1_43_0/libs/range/doc/html 1_43_0/libs/range/doc/html/range 1_43_0/libs/range/doc/html/range/concepts 1_43_0/libs/range/doc/html/range/library_headers 1_43_0/libs/range/doc/html/range/mfc_atl 1_43_0/libs/range/doc/html/range/reference 1_43_0/libs/range/doc/html/range/reference/adaptors 1_43_0/libs/range/doc/html/range/reference/adaptors/reference 1_43_0/libs/range/doc/html/range/reference/algorithms 1_43_0/libs/range/doc/html/range/reference/algorithms/heap 1_43_0/libs/range/doc/html/range/reference/algorithms/mutating 1_43_0/libs/range/doc/html/range/reference/algorithms/new 1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating 1_43_0/libs/range/doc/html/range/reference/algorithms/numeric 1_43_0/libs/range/doc/html/range/reference/algorithms/permutation 1_43_0/libs/range/doc/html/range/reference/algorithms/set 1_43_0/libs/range/doc/html/range/reference/concept_implementation 1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics 1_43_0/libs/range/doc/html/range/reference/extending 1_43_0/libs/range/doc/html/range/reference/extending/method_3 1_43_0/libs/range/doc/html/range/reference/ranges 1_43_0/libs/range/doc/html/range/reference/utilities 1_43_0/libs/range/doc/html/range/upgrade
From: daniel_james_at_[hidden]
Date: 2010-05-15 15:40:07

Author: danieljames
Date: 2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
New Revision: 62008
URL: http://svn.boost.org/trac/boost/changeset/62008

Log:
Check in a copy of the range docs, as some of the files are missing in the distribution.
Added:
   website/public_html/live/doc/libs/
   website/public_html/live/doc/libs/1_43_0/
   website/public_html/live/doc/libs/1_43_0/libs/
   website/public_html/live/doc/libs/1_43_0/libs/range/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/index.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/examples.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/faq.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/portability.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/overview.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html   (contents, props changed)
   website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html   (contents, props changed)

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/index.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/index.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,151 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter&#160;1.&#160;Range 2.0</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="next" href="range/introduction.html" title="Introduction">
+</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="n" href="range/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="chapter" title="Chapter&#160;1.&#160;Range 2.0">
+<div class="titlepage"><div>
+<div><h2 class="title">
+<a name="range"></a>Chapter&#160;1.&#160;Range 2.0</h2></div>
+<div><div class="author"><h3 class="author">
+<span class="firstname">Thorsten</span> <span class="surname">Ottosen</span>
+</h3></div></div>
+<div><div class="author"><h3 class="author">
+<span class="firstname">Neil</span> <span class="surname">Groves</span>
+</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="id554184"></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>
+</div></div>
+</div></div>
+<div class="toc">
+<p><b>Table of Contents</b></p>
+<dl>
+<dt><span class="section">Introduction</span></dt>
+<dt><span class="section"> Range Concepts</span></dt>
+<dd><dl>
+<dt><span class="section">Overview</span></dt>
+<dt><span class="section">Single Pass Range</span></dt>
+<dt><span class="section">Forward Range</span></dt>
+<dt><span class="section">Bidirectional Range</span></dt>
+<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>
+<dd><dl>
+<dt><span class="section">Overview</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">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/introduction.html"> Introduction
+        and motivation</a></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"> 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>
+<dt><span class="section"> counting_range</span></dt>
+<dt><span class="section"> istream_range</span></dt>
+<dt><span class="section"> irange</span></dt>
+</dl></dd>
+<dt><span class="section"> Utilities</span></dt>
+<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
+        member functions and nested types</a></span></dt>
+<dt><span class="section"><a href="range/reference/extending/method_2.html"> Method 2: provide
+        free-standing functions and specialize metafunctions</a></span></dt>
+<dt><span class="section"><a href="range/reference/extending/method_3.html"> Method 3: provide
+        range adaptor implementations</a></span></dt>
+</dl></dd>
+</dl></dd>
+<dt><span class="section"> Terminology and style guidelines</span></dt>
+<dt><span class="section">Library Headers</span></dt>
+<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>
+<dt><span class="section"> Requirements</span></dt>
+<dt><span class="section"> MFC Ranges</span></dt>
+<dt><span class="section"> ATL Ranges</span></dt>
+<dt><span class="section"> const Ranges</span></dt>
+<dt><span class="section"> References</span></dt>
+</dl></dd>
+<dt><span class="section"> Upgrade version of Boost.Range</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_42.html"> Upgrade from version
+      1.42</a></span></dt>
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_34.html"> Upgrade from version
+      1.34</a></span></dt>
+</dl></dd>
+<dt><span class="section">Portability</span></dt>
+<dt><span class="section">FAQ</span></dt>
+<dt><span class="section"> History and Acknowledgement</span></dt>
+</dl>
+</div>
+<p>
+    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: May 15, 2010 at 19:03:38 GMT</small></p></td>
+<td align="right"><div class="copyright-footer"></div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav"><a accesskey="n" href="range/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,51 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Range Concepts</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="introduction.html" title="Introduction">
+<link rel="next" href="concepts/overview.html" title="Overview">
+</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="introduction.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="concepts/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Range Concepts">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="range.concepts"></a><a class="link" href="concepts.html" title="Range Concepts"> Range Concepts</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section">Overview</span></dt>
+<dt><span class="section">Single Pass Range</span></dt>
+<dt><span class="section">Forward Range</span></dt>
+<dt><span class="section">Bidirectional Range</span></dt>
+<dt><span class="section">Random Access Range</span></dt>
+<dt><span class="section">Concept Checking</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="introduction.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="concepts/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,300 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Bidirectional Range</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="forward_range.html" title="Forward Range">
+<link rel="next" href="random_access_range.html" title="Random Access 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="forward_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="random_access_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Bidirectional Range">
+<div class="titlepage"><div><div><h3 class="title">
+<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="id557706"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">X</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  A type that is a model of <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">a</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  Object of type X.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.bidirectional_range.description"></a><h5>
+<a name="id557800"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
+      </h5>
+<p>
+        This concept provides access to iterators that traverse in both directions
+        (forward and reverse). The <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> iterator must meet all of the requirements
+        of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators" target="_top">Bidirectional
+        Traversal Iterator</a>.
+      </p>
+<a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
+<a name="id557864"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
+        of</a>
+      </h5>
+<p>
+        <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="id557890"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
+        types</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Reverse Iterator type
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  The type of iterator used to iterate through a Range's elements
+                  in reverse order. The iterator's value type is expected to be the
+                  Range's value type. A conversion from the reverse iterator type
+                  to the const reverse iterator type must exist.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  Const reverse iterator type
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  A type of reverse iterator that may be used to examine, but not
+                  to modify, a Range's elements.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
+<a name="id558053"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
+        expressions</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Name
+                </p>
+              </th>
+<th>
+                <p>
+                  Expression
+                </p>
+              </th>
+<th>
+                <p>
+                  Return type
+                </p>
+              </th>
+<th>
+                <p>
+                  Semantics
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Beginning of range
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
+                  is mutable <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                  <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise.
+                </p>
+              </td>
+<td>
+                <p>
+                  Equivalent to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">a</span><span class="special">))</span></code>.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  End of range
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
+                  is mutable, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                  <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise.
+                </p>
+              </td>
+<td>
+                <p>
+                  Equivalent to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">a</span><span class="special">))</span></code>.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
+<a name="id558511"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
+        guarantees</a>
+      </h5>
+<p>
+        <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> has
+        the same complexity as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> and
+        <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> has the same complexity as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> from
+        <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="id558651"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Valid reverse range
+                </p>
+              </td>
+<td>
+                <p>
+                  For any Bidirectional Range a, <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>
+                  is a valid range, that is, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> is reachable from <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                  in a finite number of increments.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  Completeness
+                </p>
+              </td>
+<td>
+                <p>
+                  An algorithm that iterates through the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>
+                  will pass through every element of <code class="computeroutput"><span class="identifier">a</span></code>.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.bidirectional_range.see_also"></a><h5>
+<a name="id558904"></a>
+        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
+      </h5>
+<p>
+        <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+        of metafunctions</a>
+      </p>
+<p>
+        <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>
+<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="forward_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="random_access_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,108 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Concept Checking</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="random_access_range.html" title="Random Access Range">
+<link rel="next" href="../reference.html" title="Reference">
+</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="random_access_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Concept Checking">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.concepts.concept_checking"></a><a class="link" href="concept_checking.html" title="Concept Checking">Concept Checking</a>
+</h3></div></div></div>
+<p>
+        Each of the range concepts has a corresponding concept checking class in
+        the file <boost/range/concepts.hpp>.
+        These classes may be used in conjunction with the <a href="../../../../../../libs/concept_check/index.html" target="_top">Boost
+        Concept Check library</a> to ensure that the type of a template parameter
+        is compatible with a range concept. If not, a meaningful compile time error
+        is generated. Checks are provided for the range concepts related to iterator
+        traversal categories. For example, the following line checks that the type
+        <code class="computeroutput"><span class="identifier">T</span></code> models the <a class="link" href="forward_range.html" title="Forward Range">Forward
+        Range</a> concept.
+      </p>
+<p>
+        
+</p>
+<pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
+</pre>
+<p>
+      </p>
+<p>
+        An additional concept check is required for the value access property of
+        the range based on the range's iterator type. For example to check for a
+        ForwardReadableRange, the following code is required.
+      </p>
+<p>
+        
+</p>
+<pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
+<span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ReadableIteratorConcept</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">));</span>
+</pre>
+<p>
+      </p>
+<p>
+        The following range concept checking classes are provided.
+      </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+          Class SinglePassRangeConcept checks for <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
+          Pass Range</a>
+</li>
+<li class="listitem">
+          Class ForwardRangeConcept checks for <a class="link" href="forward_range.html" title="Forward Range">Forward
+          Range</a>
+</li>
+<li class="listitem">
+          Class BidirectionalRangeConcept checks for <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
+          Range</a>
+</li>
+<li class="listitem">
+          Class RandomAccessRangeConcept checks for <a class="link" href="random_access_range.html" title="Random Access Range">Random
+          Access Range</a>
+</li>
+</ul></div>
+<a name="range.concepts.concept_checking.see_also"></a><h5>
+<a name="id560146"></a>
+        <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
+      </h5>
+<p>
+        <a class="link" href="../style_guide.html" title="Terminology and style guidelines">Range Terminology and style guidelines</a>
+      </p>
+<p>
+        Iterator concepts
+      </p>
+<p>
+        Boost Concept Check library
+      </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="random_access_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,160 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Forward Range</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="single_pass_range.html" title="Single Pass Range">
+<link rel="next" href="bidirectional_range.html" title="Bidirectional 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="single_pass_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="bidirectional_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Forward Range">
+<div class="titlepage"><div><div><h3 class="title">
+<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="id557310"></a>
+        <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">X</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  A type that is a model of <a class="link" href="forward_range.html" title="Forward Range">Forward
+                  Range</a>.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">a</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  Object of type X.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.forward_range.description"></a><h5>
+<a name="id557402"></a>
+        <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
+      </h5>
+<p>
+        A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
+        Traversal Iterator</a>.
+      </p>
+<a name="range.concepts.forward_range.refinement_of"></a><h5>
+<a name="id557470"></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="id557497"></a>
+        <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
+        types</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Distance type
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  A signed integral type used to represent the distance between two
+                  of the Range's iterators. This type must be the same as the iterator's
+                  distance type.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  Size type
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  An unsigned integral type that can represent any nonnegative value
+                  of the Range's distance type.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.forward_range.see_also"></a><h5>
+<a name="id557652"></a>
+        <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
+      </h5>
+<p>
+        <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+        of metafunctions</a>
+      </p>
+<p>
+        <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>
+<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="single_pass_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="bidirectional_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,79 @@
+<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.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="../concepts.html" title="Range Concepts">
+<link rel="next" href="single_pass_range.html" title="Single Pass 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="../concepts.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="single_pass_range.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.concepts.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
+</h3></div></div></div>
+<p>
+        A Range is a <span class="bold"><strong><span class="emphasis"><em>concept</em></span></strong></span>
+        similar to the STL Container
+        concept. A Range provides iterators for accessing a half-open range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">one_past_last</span><span class="special">)</span></code> of elements and provides information about
+        the number of elements in the Range. However, a Range has fewer requirements
+        than a Container.
+      </p>
+<p>
+        The motivation for the Range concept is that there are many useful Container-like
+        types that do not meet the full requirements of Container, and many algorithms
+        that can be written with this reduced set of requirements. In particular,
+        a Range does not necessarily
+      </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+          own the elements that can be accessed through it,
+        </li>
+<li class="listitem">
+          have copy semantics,
+        </li>
+</ul></div>
+<p>
+        Because of the second requirement, a Range object must be passed by (const
+        or non-const) reference in generic code.
+      </p>
+<p>
+        The operations that can be performed on a Range is dependent on the <a href="../../../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal" target="_top">traversal
+        category</a> of the underlying iterator type. Therefore the range concepts
+        are named to reflect which traversal category its iterators support. See
+        also terminology and style guidelines. for more information about naming
+        of ranges.
+      </p>
+<p>
+        The concepts described below specifies associated types as metafunctions
+        and all functions as free-standing functions to allow for a layer of indirection.
+      </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="../concepts.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="single_pass_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,187 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Random Access Range</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="bidirectional_range.html" title="Bidirectional Range">
+<link rel="next" href="concept_checking.html" title="Concept Checking">
+</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="bidirectional_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="concept_checking.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Random Access Range">
+<div class="titlepage"><div><div><h3 class="title">
+<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="id558958"></a>
+        <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
+      </h5>
+<p>
+        A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators" target="_top">Random
+        Access Traversal Iterator</a>.
+      </p>
+<a name="range.concepts.random_access_range.refinement_of"></a><h5>
+<a name="id559297"></a>
+        <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
+        of</a>
+      </h5>
+<p>
+        <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="id559325"></a>
+        <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
+        expressions</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Name
+                </p>
+              </th>
+<th>
+                <p>
+                  Expression
+                </p>
+              </th>
+<th>
+                <p>
+                  Return type
+                </p>
+              </th>
+</tr></thead>
+<tbody><tr>
+<td>
+                <p>
+                  Size of range
+                </p>
+              </td>
+<td>
+                <p>
+                  <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>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+</tr></tbody>
+</table></div>
+<a name="range.concepts.random_access_range.expression_semantics"></a><h5>
+<a name="id559468"></a>
+        <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
+        semantics</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Expression
+                </p>
+              </th>
+<th>
+                <p>
+                  Semantics
+                </p>
+              </th>
+<th>
+                <p>
+                  Postcondition
+                </p>
+              </th>
+</tr></thead>
+<tbody><tr>
+<td>
+                <p>
+                  <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>
+                </p>
+              </td>
+<td>
+                <p>
+                  Returns the size of the Range, that is, its number of elements.
+                  Note <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>
+                  <span class="special">==</span> <span class="number">0u</span></code>
+                  is equivalent to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>.
+                </p>
+              </td>
+<td>
+                <p>
+                  <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>
+                  <span class="special">&gt;=</span> <span class="number">0</span></code>
+                </p>
+              </td>
+</tr></tbody>
+</table></div>
+<a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
+<a name="id559686"></a>
+        <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
+        guarantees</a>
+      </h5>
+<p>
+        <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="id559736"></a>
+        <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody><tr>
+<td>
+                <p>
+                  Range size
+                </p>
+              </td>
+<td>
+                <p>
+                  <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>
+                  is equal to the <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> - <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</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="bidirectional_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="concept_checking.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,350 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Single Pass Range</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="overview.html" title="Overview">
+<link rel="next" href="forward_range.html" title="Forward 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="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="forward_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Single Pass Range">
+<div class="titlepage"><div><div><h3 class="title">
+<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="id555984"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">X</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  A type that is a model of <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
+                  Pass Range</a>.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">a</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  Object of type X.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.single_pass_range.description"></a><h5>
+<a name="id556080"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
+      </h5>
+<p>
+        A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators" target="_top">Single
+        Pass Iterator</a>.
+      </p>
+<a name="range.concepts.single_pass_range.associated_types"></a><h5>
+<a name="id556148"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
+        types</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Iterator type
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  The type of iterator used to iterate through a Range's elements.
+                  The iterator's value type is expected to be the Range's value type.
+                  A conversion from the iterator type to the <code class="computeroutput"><span class="keyword">const</span></code>
+                  iterator type must exist.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  Const iterator type
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  A type of iterator that may be used to examine, but not to modify,
+                  a Range's elements.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
+<a name="id556317"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
+        expressions</a>
+      </h5>
+<p>
+        The following expressions must be valid.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Name
+                </p>
+              </th>
+<th>
+                <p>
+                  Expression
+                </p>
+              </th>
+<th>
+                <p>
+                  Return type
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Beginning of range
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
+                  is mutable, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                  <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  End of range
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
+                  is mutable, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                  <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
+<a name="id556638"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
+        semantics</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Expression
+                </p>
+              </th>
+<th>
+                <p>
+                  Semantics
+                </p>
+              </th>
+<th>
+                <p>
+                  Postcondition
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  Returns an iterator pointing to the first element in the Range.
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                  is either dereferenceable or past-the-end. It is past-the-end if
+                  and only if <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span> <span class="special">==</span> <span class="number">0</span></code>.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  Returns an iterator pointing one past the last element in the Range.
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                  is past-the-end.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
+<a name="id556900"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
+        guarantees</a>
+      </h5>
+<p>
+        <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> is at most amortized linear time, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> is amortized
+        constant time. For most practical purposes, one can expect both to be amortized
+        constant time.
+      </p>
+<a name="range.concepts.single_pass_range.invariants"></a><h5>
+<a name="id556981"></a>
+        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
+      </h5>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  Valid range
+                </p>
+              </td>
+<td>
+                <p>
+                  For any Range <code class="computeroutput"><span class="identifier">a</span></code>,
+                  <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">a</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">a</span><span class="special">))</span></code> is a valid range, that is, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
+                  is reachable from <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> in a finite number of increments.
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  Completeness
+                </p>
+              </td>
+<td>
+                <p>
+                  An algorithm that iterates through 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">a</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">a</span><span class="special">))</span></code>
+                  will pass through every element of <code class="computeroutput"><span class="identifier">a</span></code>.
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.concepts.single_pass_range.see_also"></a><h5>
+<a name="id557241"></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/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+        of metafunctions</a>
+      </p>
+<p>
+        <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+        of functions</a>
+      </p>
+<p>
+        Container
+      </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="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.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="forward_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/examples.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/examples.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,62 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Examples</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/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">
+<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="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">
+<a name="range.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
+</h2></div></div></div>
+<p>
+      Some examples are given in the accompanying test files:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+string.cpp
+        shows how to implement a container version of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">()</span></code> that works with <code class="computeroutput"><span class="keyword">char</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">char</span><span class="special">*</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">*</span></code>.
+      </li>
+<li class="listitem">
+algorithm_example.cpp
+        shows the replace example from the introduction.
+      </li>
+<li class="listitem">iterator_range.cpp</li>
+<li class="listitem">sub_range.cpp</li>
+<li class="listitem">iterator_pair.cpp</li>
+<li class="listitem">reversible_range.cpp</li>
+<li class="listitem">std_container.cpp</li>
+<li class="listitem">array.cpp</li>
+</ul></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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/faq.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/faq.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,126 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>FAQ</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="portability.html" title="Portability">
+<link rel="next" href="history_ack.html" title="History and Acknowledgement">
+</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="portability.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="history_ack.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="FAQ">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="range.faq"></a><a class="link" href="faq.html" title="FAQ">FAQ</a>
+</h2></div></div></div>
+<p>
+      1. <span class="emphasis"><em><span class="bold"><strong>Why is there no difference between <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">C</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+      and <code class="computeroutput"><span class="identifier">range_const_iterator</span><span class="special">&lt;</span><span class="identifier">C</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+      for <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>?</strong></span></em></span>
+    </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+        </p>
+<p>
+          In general it is not possible nor desirable to find a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>. When it is possible to
+          come up with one, the client might choose to construct a <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">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code>
+          object.
+        </p>
+<p>
+      </p>
+</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+        </p>
+<p>
+          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="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>
+</blockquote></div>
+<p>
+      2. <span class="emphasis"><em><span class="bold"><strong>Why is there not supplied more types or
+      more functions?</strong></span></em></span>
+    </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+        </p>
+<p>
+          The library has been kept small because its current interface will serve
+          most purposes. If and when a genuine need arises for more functionality,
+          it can be implemented.
+        </p>
+<p>
+      </p>
+</blockquote></div>
+<p>
+      3. <span class="emphasis"><em><span class="bold"><strong>How should I implement generic algorithms
+      for ranges?</strong></span></em></span>
+    </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+        </p>
+<p>
+          One should always start with a generic algorithm that takes two iterators
+          (or more) as input. Then use Boost.Range to build handier versions on top
+          of the iterator based algorithm. Please notice that once the range version
+          of the algorithm is done, it makes sense not to expose the iterator version
+          in the public interface.
+        </p>
+<p>
+      </p>
+</blockquote></div>
+<p>
+      4. <span class="emphasis"><em><span class="bold"><strong>Why is there no Incrementable Range concept?</strong></span></em></span>
+    </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+        </p>
+<p>
+          Even though we speak of incrementable iterators, it would not make much
+          sense for ranges; for example, we cannot determine the size and emptiness
+          of a range since we cannot even compare its iterators.
+        </p>
+<p>
+      </p>
+</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+        </p>
+<p>
+          Note also that incrementable iterators are derived from output iterators
+          and so there exist no output range.
+        </p>
+<p>
+      </p>
+</blockquote></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="portability.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="history_ack.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,148 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>History and Acknowledgement</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="faq.html" title="FAQ">
+</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="faq.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>
+</div>
+<div class="section" title="History and Acknowledgement">
+<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="id688219"></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
+      template which had most of the functionality present now, but only for arrays
+      and standard containers.
+    </p>
+<p>
+      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.
+    </p>
+<p>
+      The term Range was adopted because of paragraph 24.1/7 from the C++ standard:
+    </p>
+<p>
+      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.
+    </p>
+<p>
+      Special thanks goes to
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+        Pavol Droba for help with documentation and implementation
+      </li>
+<li class="listitem">
+        Pavel Vozenilek for help with porting the library
+      </li>
+<li class="listitem">
+        Jonathan Turkanis and John Torjo for help with documentation
+      </li>
+<li class="listitem">
+        Hartmut Kaiser for being review manager
+      </li>
+<li class="listitem">
+        Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+      </li>
+</ul></div>
+<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="id688312"></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>
+<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="faq.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>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,154 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Introduction</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="next" href="concepts.html" title="Range Concepts">
+</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="../index.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="concepts.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Introduction">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="range.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
+</h2></div></div></div>
+<p>
+      Generic algorithms have so far been specified in terms of two or more iterators.
+      Two iterators would together form a range of values that the algorithm could
+      work on. This leads to a very general interface, but also to a somewhat clumsy
+      use of the algorithms with redundant specification of container names. Therefore
+      we would like to raise the abstraction level for algorithms so they specify
+      their interface in terms of <a class="link" href="concepts.html" title="Range Concepts">Ranges</a> as
+      much as possible.
+    </p>
+<p>
+      The most common form of ranges used throughout the C++ community are standard
+      library containers. When writing algorithms however, one often finds it desirable
+      for the algorithm to accept other types that offer enough functionality to
+      satisfy the needs of the generic code <span class="bold"><strong><span class="emphasis"><em>if a
+      suitable layer of indirection is applied</em></span></strong></span> . For example,
+      raw arrays are often suitable for use with generic code that works with containers,
+      provided a suitable adapter is used. Likewise, null terminated strings can
+      be treated as containers of characters, if suitably adapted.
+    </p>
+<p>
+      This library therefore provides the means to adapt standard-like containers,
+      null terminated strings, <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pairs</span></code> of
+      iterators, and raw arrays (and more), such that the same generic code can work
+      with them all. The basic idea is to add another layer of indirection using
+      metafunctions
+      and free-standing functions so syntactic and/or semantic differences can be
+      removed.
+    </p>
+<p>
+      The main advantages are
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+        simpler implementation and specification of generic range algorithms
+      </li>
+<li class="listitem">
+        more flexible, compact and maintainable client code
+      </li>
+<li class="listitem">
+        safe use of built-in arrays (for legacy code; why else would you use built-in
+        arrays?)
+      </li>
+</ul></div>
+<p>
+      Below are given a small example (the complete example can be found here
+      ):
+    </p>
+<p>
+      
+</p>
+<pre class="programlisting"><span class="comment">//
+</span><span class="comment">// example: extracting bounds in a generic algorithm
+</span><span class="comment">//
+</span><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find</span><span class="special">(</span> <span class="identifier">ForwardReadableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span> <span class="special">)</span>
+<span class="special">{</span>
+   <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</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">c</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">c</span> <span class="special">),</span> <span class="identifier">value</span> <span class="special">);</span>
+<span class="special">}</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span> <span class="special">)</span>
+<span class="special">{</span>
+   <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</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">c</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">c</span> <span class="special">),</span> <span class="identifier">value</span> <span class="special">);</span>
+<span class="special">}</span>
+
+<span class="comment">//
+</span><span class="comment">// replace first value and return its index
+</span><span class="comment">//
+</span><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableWriteableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableWriteableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">ForwardReadableWriteableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">replacement</span> <span class="special">)</span>
+<span class="special">{</span>
+   <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableWriteableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">found</span> <span class="special">=</span> <span class="identifier">find</span><span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">value</span> <span class="special">);</span>
+
+   <span class="keyword">if</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">c</span> <span class="special">)</span> <span class="special">)</span>
+       <span class="special">*</span><span class="identifier">found</span> <span class="special">=</span> <span class="identifier">replacement</span><span class="special">;</span>
+   <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">),</span> <span class="identifier">found</span> <span class="special">);</span>
+<span class="special">}</span>
+
+<span class="comment">//
+</span><span class="comment">// usage
+</span><span class="comment">//
+</span><span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">N</span> <span class="special">=</span> <span class="number">5</span><span class="special">;</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">my_vector</span><span class="special">;</span>
+<span class="keyword">int</span> <span class="identifier">values</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span> <span class="special">};</span>
+
+<span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span> <span class="identifier">values</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">values</span> <span class="special">)</span> <span class="special">);</span>
+<span class="keyword">typedef</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">iterator</span><span class="special">;</span>
+<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>       <span class="identifier">my_view</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">my_vector</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">my_vector</span> <span class="special">)</span> <span class="special">+</span> <span class="identifier">N</span> <span class="special">);</span>
+<span class="keyword">char</span>  <span class="identifier">str_val</span><span class="special">[]</span> <span class="special">=</span> <span class="string">"a string"</span><span class="special">;</span>
+<span class="keyword">char</span><span class="special">*</span> <span class="identifier">str</span>       <span class="special">=</span> <span class="identifier">str_val</span><span class="special">;</span>
+
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">my_vector</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">2</span> <span class="special">);</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">my_view</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">2</span> <span class="special">);</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="char">'a'</span><span class="special">,</span> <span class="char">'b'</span> <span class="special">);</span>
+
+<span class="comment">// prints '3', '5' and '0'
+</span></pre>
+<p>
+    </p>
+<p>
+      By using the free-standing functions and metafunctions,
+      the code automatically works for all the types supported by this library; now
+      and in the future. Notice that we have to provide two versions of <code class="computeroutput"><span class="identifier">find</span><span class="special">()</span></code> since
+      we cannot forward a non-const rvalue with reference arguments (see this article
+      about <a href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">The
+      Forwarding Problem</a> ).
+    </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="../index.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="concepts.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Library Headers</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="library_headers/general.html" title="General">
+</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="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="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>
+<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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,232 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Adaptors</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../library_headers.html" title="Library Headers">
+<link rel="prev" href="general.html" title="General">
+<link rel="next" href="algorithm.html" title="Algorithm">
+</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="general.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Adaptors">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.library_headers.adaptors"></a><a class="link" href="adaptors.html" title="Adaptors">Adaptors</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Header
+                </p>
+              </th>
+<th>
+                <p>
+                  Includes
+                </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">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</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/adaptors/reference/adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</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">adaptor</span><span class="special">/</span><span class="identifier">copied</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/adaptors/reference/copied.html" title="copied">copied</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">adaptor</span><span class="special">/</span><span class="identifier">filtered</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/adaptors/reference/filtered.html" title="filtered">filtered</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">adaptor</span><span class="special">/</span><span class="identifier">indexed</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/adaptors/reference/indexed.html" title="indexed">indexed</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">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">.</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../reference/adaptors/reference/indirected.html" title="indirected">indirected</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">adaptor</span><span class="special">/</span><span class="identifier">map</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/adaptors/reference/map_keys.html" title="map_keys">map_keys</a>
+                  <a class="link" href="../reference/adaptors/reference/map_values.html" title="map_values">map_values</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">adaptor</span><span class="special">/</span><span class="identifier">replaced</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/adaptors/reference/replaced.html" title="replaced">replaced</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">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</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/adaptors/reference/replaced_if.html" title="replaced_if">replaced_if</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">adaptor</span><span class="special">/</span><span class="identifier">reversed</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/adaptors/reference/reversed.html" title="reversed">reversed</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">adaptor</span><span class="special">/</span><span class="identifier">sliced</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/adaptors/reference/sliced.html" title="sliced">sliced</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">adaptor</span><span class="special">/</span><span class="identifier">strided</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/adaptors/reference/strided.html" title="strided">strided</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">adaptor</span><span class="special">/</span><span class="identifier">tokenized</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/adaptors/reference/tokenized.html" title="tokenized">tokenized</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">adaptor</span><span class="special">/</span><span class="identifier">transformed</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/adaptors/reference/transformed.html" title="transformed">transformed</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">adaptor</span><span class="special">/</span><span class="identifier">uniqued</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/adaptors/reference/uniqued.html" title="uniqued">uniqued</a>
+                </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="general.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,683 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Algorithm</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../library_headers.html" title="Library Headers">
+<link rel="prev" href="adaptors.html" title="Adaptors">
+<link rel="next" href="algorithm_extensions.html" title="Algorithm Extensions">
+</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="adaptors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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="algorithm_extensions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Algorithm">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.library_headers.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Header
+                </p>
+              </th>
+<th>
+                <p>
+                  Includes
+                </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">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</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/algorithms/non_mutating/adjacent_find.html" title="adjacent_find">adjacent_find</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">algorithm</span><span class="special">/</span><span class="identifier">binary_search</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/algorithms/non_mutating/binary_search.html" title="binary_search">binary_search</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">algorithm</span><span class="special">/</span><span class="identifier">copy</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/algorithms/mutating/copy.html" title="copy">copy</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">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</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/algorithms/mutating/copy_backward.html" title="copy_backward">copy_backward</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">algorithm</span><span class="special">/</span><span class="identifier">count</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/algorithms/non_mutating/count.html" title="count">count</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">algorithm</span><span class="special">/</span><span class="identifier">count_if</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/algorithms/non_mutating/count_if.html" title="count_if">count_if</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">algorithm</span><span class="special">/</span><span class="identifier">equal</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/algorithms/non_mutating/equal.html" title="equal">equal</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">algorithm</span><span class="special">/</span><span class="identifier">equal_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="../reference/algorithms/non_mutating/equal_range.html" title="equal_range">equal_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">algorithm</span><span class="special">/</span><span class="identifier">fill</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/algorithms/mutating/fill.html" title="fill">fill</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">algorithm</span><span class="special">/</span><span class="identifier">fill_n</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/algorithms/mutating/fill_n.html" title="fill_n">fill_n</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">algorithm</span><span class="special">/</span><span class="identifier">find</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/algorithms/non_mutating/find.html" title="find">find</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">algorithm</span><span class="special">/</span><span class="identifier">find_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/algorithms/non_mutating/find_end.html" title="find_end">find_end</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">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</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/algorithms/non_mutating/find_first_of.html" title="find_first_of">find_first_of</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">algorithm</span><span class="special">/</span><span class="identifier">find_if</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/algorithms/non_mutating/find_if.html" title="find_if">find_if</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">algorithm</span><span class="special">/</span><span class="identifier">for_each</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/algorithms/non_mutating/for_each.html" title="for_each">for_each</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">algorithm</span><span class="special">/</span><span class="identifier">generate</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/algorithms/mutating/generate.html" title="generate">generate</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">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</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/algorithms/heap/push_heap.html" title="push_heap">push_heap</a>
+                  <a class="link" href="../reference/algorithms/heap/pop_heap.html" title="pop_heap">pop_heap</a>
+                  <a class="link" href="../reference/algorithms/heap/make_heap.html" title="make_heap">make_heap</a>
+                  <a class="link" href="../reference/algorithms/heap/sort_heap.html" title="sort_heap">sort_heap</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">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</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/algorithms/mutating/inplace_merge.html" title="inplace_merge">inplace_merge</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">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</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/algorithms/non_mutating/lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</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">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</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/algorithms/non_mutating/lower_bound.html" title="lower_bound">lower_bound</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">algorithm</span><span class="special">/</span><span class="identifier">max_element</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/algorithms/non_mutating/max_element.html" title="max_element">max_element</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">algorithm</span><span class="special">/</span><span class="identifier">merge</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/algorithms/mutating/merge.html" title="merge">merge</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">algorithm</span><span class="special">/</span><span class="identifier">min_element</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/algorithms/non_mutating/min_element.html" title="min_element">min_element</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">algorithm</span><span class="special">/</span><span class="identifier">mismatch</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/algorithms/non_mutating/mismatch.html" title="mismatch">mismatch</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">algorithm</span><span class="special">/</span><span class="identifier">nth_element</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/algorithms/mutating/nth_element.html" title="nth_element">nth_element</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">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</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/algorithms/mutating/partial_sort.html" title="partial_sort">partial_sort</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">algorithm</span><span class="special">/</span><span class="identifier">partition</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/algorithms/mutating/partition.html" title="partition">partition</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">algorithm</span><span class="special">/</span><span class="identifier">permutation</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/algorithms/permutation/next_permutation.html" title="next_permutation">next_permutation</a>
+                  <a class="link" href="../reference/algorithms/permutation/prev_permutation.html" title="prev_permutation">prev_permutation</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">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</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/algorithms/mutating/random_shuffle.html" title="random_shuffle">random_shuffle</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">algorithm</span><span class="special">/</span><span class="identifier">remove</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/algorithms/mutating/remove.html" title="remove">remove</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">algorithm</span><span class="special">/</span><span class="identifier">remove_copy</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/algorithms/mutating/remove_copy.html" title="remove_copy">remove_copy</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">algorithm</span><span class="special">/</span><span class="identifier">remove_copy_if</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/algorithms/mutating/remove_copy_if.html" title="remove_copy_if">remove_copy_if</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">algorithm</span><span class="special">/</span><span class="identifier">remove_if</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/algorithms/mutating/remove_if.html" title="remove_if">remove_if</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">algorithm</span><span class="special">/</span><span class="identifier">replace</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/algorithms/mutating/replace.html" title="replace">replace</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">algorithm</span><span class="special">/</span><span class="identifier">replace_copy</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/algorithms/mutating/replace_copy.html" title="replace_copy">replace_copy</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">algorithm</span><span class="special">/</span><span class="identifier">replace_copy_if</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/algorithms/mutating/replace_copy_if.html" title="replace_copy_if">replace_copy_if</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">algorithm</span><span class="special">/</span><span class="identifier">replace_if</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/algorithms/mutating/replace_if.html" title="replace_if">replace_if</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">algorithm</span><span class="special">/</span><span class="identifier">reverse</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/algorithms/mutating/reverse.html" title="reverse">reverse</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">algorithm</span><span class="special">/</span><span class="identifier">reverse_copy</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/algorithms/mutating/reverse_copy.html" title="reverse_copy">reverse_copy</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">algorithm</span><span class="special">/</span><span class="identifier">rotate</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/algorithms/mutating/rotate.html" title="rotate">rotate</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">algorithm</span><span class="special">/</span><span class="identifier">rotate_copy</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/algorithms/mutating/rotate_copy.html" title="rotate_copy">rotate_copy</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">algorithm</span><span class="special">/</span><span class="identifier">search</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/algorithms/non_mutating/search.html" title="search">search</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">algorithm</span><span class="special">/</span><span class="identifier">search_n</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/algorithms/non_mutating/search_n.html" title="search_n">search_n</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">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</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/algorithms/set/includes.html" title="includes">includes</a>
+                  <a class="link" href="../reference/algorithms/set/set_union.html" title="set_union">set_union</a>
+                  <a class="link" href="../reference/algorithms/set/set_intersection.html" title="set_intersection">set_intersection</a>
+                  <a class="link" href="../reference/algorithms/set/set_difference.html" title="set_difference">set_difference</a>
+                  <a class="link" href="../reference/algorithms/set/set_symmetric_difference.html" title="set_symmetric_difference">set_symmetric_difference</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">algorithm</span><span class="special">/</span><span class="identifier">sort</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/algorithms/mutating/sort.html" title="sort">sort</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">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</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/algorithms/mutating/stable_partition.html" title="stable_partition">stable_partition</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">algorithm</span><span class="special">/</span><span class="identifier">swap_ranges</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/algorithms/mutating/swap_ranges.html" title="swap_ranges">swap_ranges</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">algorithm</span><span class="special">/</span><span class="identifier">transform</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/algorithms/mutating/transform.html" title="transform">transform</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">algorithm</span><span class="special">/</span><span class="identifier">unique</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/algorithms/mutating/unique.html" title="unique">unique</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">algorithm</span><span class="special">/</span><span class="identifier">unique_copy</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/algorithms/mutating/unique_copy.html" title="unique_copy">unique_copy</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">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</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/algorithms/non_mutating/upper_bound.html" title="upper_bound">upper_bound</a>
+                </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="adaptors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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="algorithm_extensions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,172 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Algorithm Extensions</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../library_headers.html" title="Library Headers">
+<link rel="prev" href="algorithm.html" title="Algorithm">
+<link rel="next" href="../examples.html" title="Examples">
+</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="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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>
+</div>
+<div class="section" title="Algorithm Extensions">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.library_headers.algorithm_extensions"></a><a class="link" href="algorithm_extensions.html" title="Algorithm Extensions">Algorithm
+      Extensions</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Header
+                </p>
+              </th>
+<th>
+                <p>
+                  Includes
+                </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">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</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/algorithms/new/copy_n.html" title="copy_n">copy_n</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">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</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/algorithms/new/erase.html" title="erase">erase</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">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</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/algorithms/new/for_each.html" title="for_each">for_each</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">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</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/algorithms/new/insert.html" title="insert">insert</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">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</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/algorithms/new/iota.html" title="iota">iota</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">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</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/algorithms/new/is_sorted.html" title="is_sorted">is_sorted</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">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</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/algorithms/new/overwrite.html" title="overwrite">overwrite</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">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</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/algorithms/new/push_back.html" title="push_back">push_back</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">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</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/algorithms/new/push_front.html" title="push_front">push_front</a>
+                </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="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,551 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>General</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../library_headers.html" title="Library Headers">
+<link rel="prev" href="../library_headers.html" title="Library Headers">
+<link rel="next" href="adaptors.html" title="Adaptors">
+</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="../library_headers.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="General">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.library_headers.general"></a><a class="link" href="general.html" title="General">General</a>
+</h3></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/concept_implementation/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/concept_implementation/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/concept_implementation/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/concept_implementation/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/concept_implementation/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/concept_implementation/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/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a> and <a class="link" href="../reference/concept_implementation/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/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a> and <a class="link" href="../reference/concept_implementation/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/concept_implementation/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/concept_implementation/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/concept_implementation/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/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">rbegin</span></code></a> and <a class="link" href="../reference/concept_implementation/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/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">rend</span></code></a> and <a class="link" href="../reference/concept_implementation/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/concept_implementation/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/concept_implementation/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="../reference/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="../reference/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>
+<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">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  every range adaptor
+                </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">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  every range equivalent of an STL algorithm
+                </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">algorithm_ext</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  every range algorithm that is an extension of the STL 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">counting_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="../reference/ranges/counting_range.html" title="counting_range"><code class="computeroutput"><span class="identifier">counting_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">istream_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="../reference/ranges/istream_range.html" title="istream_range"><code class="computeroutput"><span class="identifier">istream_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">irange</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/ranges/irange.html" title="irange"><code class="computeroutput"><span class="identifier">irange</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">join</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/utilities/join.html" title="Function join"><code class="computeroutput"><span class="identifier">join</span></code></a>
+                </p>
+              </td>
+<td>
+                <p>
+                  -
+                </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="../library_headers.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.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.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,141 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>MFC/ATL (courtesy of Shunsuke Sogame)</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="examples.html" title="Examples">
+<link rel="next" href="mfc_atl/requirements.html" title="Requirements">
+</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="examples.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/requirements.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="range.mfc_atl"></a><a class="link" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)"> MFC/ATL (courtesy of Shunsuke Sogame)</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> Requirements</span></dt>
+<dt><span class="section"> MFC Ranges</span></dt>
+<dt><span class="section"> ATL Ranges</span></dt>
+<dt><span class="section"> const Ranges</span></dt>
+<dt><span class="section"> References</span></dt>
+</dl></div>
+<a name="range.mfc_atl.introduction"></a><h5>
+<a name="id681998"></a>
+      <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
+    </h5>
+<p>
+      This implementation was kindly donated by Shunsuke Sogame. This header adapts
+      MFC and ATL containers to the appropriate Range concepts.
+    </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+              <p>
+                <span class="bold"><strong>Author:</strong></span>
+              </p>
+            </td>
+<td>
+              <p>
+                Shunsuke Sogame
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                <span class="bold"><strong>Contact:</strong></span>
+              </p>
+            </td>
+<td>
+              <p>
+                mb2act_at_[hidden]
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                <span class="bold"><strong>Date:</strong></span>
+              </p>
+            </td>
+<td>
+              <p>
+                26th of May 2006
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                <span class="bold"><strong>Copyright:</strong></span>
+              </p>
+            </td>
+<td>
+              <p>
+                Shunsuke Sogame 2005-2006. Use, modification and distribution is
+                subject to the Boost Software License, Version 1.0
+              </p>
+            </td>
+</tr>
+</tbody>
+</table></div>
+<a name="range.mfc_atl.overview"></a><h5>
+<a name="id682134"></a>
+      <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
+    </h5>
+<p>
+      Boost.Range MFC/ATL Extension provides Boost.Range support for MFC/ATL collection
+      and string types.
+    </p>
+<p>
+      
+</p>
+<pre class="programlisting"><span class="identifier">CTypedPtrArray</span><span class="special">&lt;</span><span class="identifier">CPtrArray</span><span class="special">,</span> <span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">CString</span><span class="special">&gt;</span> <span class="special">*&gt;</span> <span class="identifier">myArray</span><span class="special">;</span>
+<span class="special">...</span>
+<span class="identifier">BOOST_FOREACH</span> <span class="special">(</span><span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">CString</span><span class="special">&gt;</span> <span class="special">*</span><span class="identifier">theList</span><span class="special">,</span> <span class="identifier">myArray</span><span class="special">)</span>
+<span class="special">{</span>
+    <span class="identifier">BOOST_FOREACH</span> <span class="special">(</span><span class="identifier">CString</span><span class="special">&amp;</span> <span class="identifier">str</span><span class="special">,</span> <span class="special">*</span><span class="identifier">theList</span><span class="special">)</span>
+    <span class="special">{</span>
+        <span class="identifier">boost</span><span class="special">::</span><span class="identifier">to_upper</span><span class="special">(</span><span class="identifier">str</span><span class="special">);</span>
+        <span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</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">str</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">str</span><span class="special">));</span>
+        <span class="special">...</span>
+    <span class="special">}</span>
+<span class="special">}</span>
+</pre>
+<p>
+    </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="examples.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/requirements.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,374 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>ATL Ranges</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
+<link rel="next" href="const_ranges.html" title="const Ranges">
+</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="mfc_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="const_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="ATL Ranges">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.mfc_atl.atl_ranges"></a><a class="link" href="atl_ranges.html" title="ATL Ranges"> ATL Ranges</a>
+</h3></div></div></div>
+<p>
+        If the <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">atl</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+        is included before or after Boost.Range headers, the ATL collections and
+        strings become models of Range. The table below lists the Traversal Category
+        and <code class="computeroutput"><span class="identifier">range_reference</span></code> of ATL
+        ranges.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Range
+                </p>
+              </th>
+<th>
+                <p>
+                  Traversal Category
+                </p>
+              </th>
+<th>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CAtlArray</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">,</span><span class="identifier">ET</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CAutoPtrArray</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CInterfaceArray</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CComQIPtr</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CAtlList</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">,</span><span class="identifier">ET</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CAutoPtrList</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CHeapPtrList</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">,</span><span class="identifier">A</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CInterfaceList</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CComQIPtr</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CAtlMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CRBTree</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CRBMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CRBMultiMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CSimpleStringT</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">b</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">B</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CStringT</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">ST</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">B</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CFixedStringT</span><span class="special">&lt;</span><span class="identifier">S</span><span class="special">,</span><span class="identifier">n</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">S</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CComBSTR</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">OLECHAR</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CSimpleArray</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">TE</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">T</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+        Other <a class="link" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">Boost.Range</a> metafunctions are defined
+        by the following. Let <code class="computeroutput"><span class="identifier">Range</span></code>
+        be any type listed above and <code class="computeroutput"><span class="identifier">Ref</span></code>
+        be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+        <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span></code>,
+        <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span></code>,
+        and <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">add_pointer</span><span class="special">&lt;</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+        As for <code class="computeroutput"><span class="keyword">const</span> <span class="identifier">Range</span></code>,
+        see below.
+      </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="mfc_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="const_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,125 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>const Ranges</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="atl_ranges.html" title="ATL Ranges">
+<link rel="next" href="references.html" title="References">
+</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="atl_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="const Ranges">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.mfc_atl.const_ranges"></a><a class="link" href="const_ranges.html" title="const Ranges"> const Ranges</a>
+</h3></div></div></div>
+<p>
+        <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+        is defined by the following algorithm. Let <code class="computeroutput"><span class="identifier">Range</span></code>
+        be any type listed above and <code class="computeroutput"><span class="identifier">Ref</span></code>
+        be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+      </p>
+<p>
+        
+</p>
+<pre class="programlisting"><span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObList</span><span class="special">)</span>
+    <span class="keyword">return</span> <span class="identifier">CObject</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&amp;</span>
+<span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CPtrArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CPtrList</span><span class="special">)</span>
+    <span class="keyword">return</span> <span class="keyword">void</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&amp;</span>
+<span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">there</span> <span class="identifier">is</span> <span class="identifier">a</span> <span class="identifier">type</span> <span class="identifier">X</span> <span class="identifier">such</span> <span class="identifier">that</span> <span class="identifier">X</span><span class="special">&amp;</span> <span class="identifier">is</span> <span class="identifier">the</span> <span class="identifier">same</span> <span class="identifier">as</span> <span class="identifier">Ref</span><span class="special">)</span>
+    <span class="keyword">return</span> <span class="identifier">X</span> <span class="keyword">const</span> <span class="special">&amp;</span>
+<span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">there</span> <span class="identifier">is</span> <span class="identifier">a</span> <span class="identifier">type</span> <span class="identifier">X</span> <span class="identifier">such</span> <span class="identifier">that</span> <span class="identifier">X</span><span class="special">*</span> <span class="keyword">const</span> <span class="identifier">is</span> <span class="identifier">the</span> <span class="identifier">same</span> <span class="identifier">as</span> <span class="identifier">Ref</span><span class="special">)</span>
+    <span class="keyword">return</span> <span class="identifier">X</span> <span class="keyword">const</span> <span class="special">*</span> <span class="keyword">const</span>
+<span class="keyword">else</span>
+    <span class="keyword">return</span> <span class="identifier">Ref</span>
+</pre>
+<p>
+      </p>
+<p>
+        Other Boost.Range metafunctions are defined by the following.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Range metafunction
+                </p>
+              </th>
+<th>
+                <p>
+                  Result
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span>
+                  <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">add_pointer</span><span class="special">&lt;</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</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="atl_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,480 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>MFC Ranges</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="requirements.html" title="Requirements">
+<link rel="next" href="atl_ranges.html" title="ATL Ranges">
+</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="requirements.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="atl_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="MFC Ranges">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.mfc_atl.mfc_ranges"></a><a class="link" href="mfc_ranges.html" title="MFC Ranges"> MFC Ranges</a>
+</h3></div></div></div>
+<p>
+        If the <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">mfc</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
+        is included before or after Boost.Range headers, the MFC collections and
+        strings become models of Range. The table below lists the Traversal Category
+        and <code class="computeroutput"><span class="identifier">range_reference</span></code> of MFC
+        ranges.
+      </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                <p>
+                  Range
+                </p>
+              </th>
+<th>
+                <p>
+                  Traversal Category
+                </p>
+              </th>
+<th>
+                <p>
+                  <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                </p>
+              </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CArray</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">A</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">T</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">A</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">T</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">AK</span><span class="special">,</span><span class="identifier">M</span><span class="special">,</span><span class="identifier">AM</span><span class="special">&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CTypedPtrArray</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">T</span><span class="special">*&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">T</span><span class="special">*</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CTypedPtrList</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">T</span><span class="special">*&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">T</span><span class="special">*</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CTypedPtrMap</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">T</span><span class="special">*,</span><span class="identifier">V</span><span class="special">*&gt;</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <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">T</span><span class="special">*,</span><span class="identifier">V</span><span class="special">*&gt;</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CByteArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">BYTE</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CDWordArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">DWORD</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CObArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CObject</span><span class="special">*&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CPtrArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="keyword">void</span><span class="special">*&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CStringArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CString</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CUIntArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">UINT</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CWordArray</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">WORD</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CObList</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CObject</span><span class="special">*&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CPtrList</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="keyword">void</span><span class="special">*&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CStringList</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                  Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CString</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMapPtrToWord</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">void</span><span class="special">*,</span><span class="identifier">WORD</span><span class="special">&gt;</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMapPtrToPtr</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">void</span><span class="special">*,</span><span class="keyword">void</span><span class="special">*&gt;</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMapStringToOb</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <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">String</span><span class="special">,</span><span class="identifier">CObject</span><span class="special">*&gt;</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMapStringToString</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMapWordToOb</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <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">WORD</span><span class="special">,</span><span class="identifier">CObject</span><span class="special">*&gt;</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+<tr>
+<td>
+                <p>
+                  <code class="computeroutput"><span class="identifier">CMapWordToPtr</span></code>
+                </p>
+              </td>
+<td>
+                <p>
+                  <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+                </p>
+              </td>
+<td>
+                <p>
+                  <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">WORD</span><span class="special">,</span><span class="keyword">void</span><span class="special">*&gt;</span>
+                  <span class="keyword">const</span></code>
+                </p>
+              </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+        Other Boost.Range metafunctions are defined by the following. Let <code class="computeroutput"><span class="identifier">Range</span></code> be any type listed above and <code class="computeroutput"><span class="identifier">Ref</span></code> be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+        <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">remove_const</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>,
+        <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span></code>,
+        and <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">add_pointer</span><span class="special">&lt;</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+        As for <code class="computeroutput"><span class="keyword">const</span> <span class="identifier">Range</span></code>,
+        see below.
+      </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="requirements.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="atl_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>References</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="const_ranges.html" title="const Ranges">
+<link rel="next" href="../upgrade.html" title="Upgrade version of Boost.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="const_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="../upgrade.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="References">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.mfc_atl.references"></a><a class="link" href="references.html" title="References"> References</a>
+</h3></div></div></div>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem"><a class="link" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">Boost.Range</a></li>
+<li class="listitem"><a href="http://msdn.microsoft.com/en-us/library/942860sh.aspx" target="_top">MFC
+          Collection Classes</a></li>
+<li class="listitem"><a href="http://msdn.microsoft.com/en-us/library/15e672bd.aspx" target="_top">ATL
+          Collection Classes</a></li>
+</ol></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="const_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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="../upgrade.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,51 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Requirements</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="next" href="mfc_ranges.html" title="MFC Ranges">
+</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="../mfc_atl.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Requirements">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.mfc_atl.requirements"></a><a class="link" href="requirements.html" title="Requirements"> Requirements</a>
+</h3></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+          Boost C++ Libraries Version 1.34.0 or later (no compilation required)
+        </li>
+<li class="listitem">
+          Visual C++ 7.1 or later (for MFC and ATL)
+        </li>
+</ul></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="../mfc_atl.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.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_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/portability.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/portability.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,91 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Portability</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
+<link rel="next" href="faq.html" title="FAQ">
+</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="upgrade/upgrade_from_1_34.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="faq.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Portability">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="range.portability"></a><a class="link" href="portability.html" title="Portability">Portability</a>
+</h2></div></div></div>
+<p>
+      A huge effort has been made to port the library to as many compilers as possible.
+    </p>
+<p>
+      Full support for built-in arrays require that the compiler supports class template
+      partial specialization. For non-conforming compilers there might be a chance
+      that it works anyway thanks to workarounds in the type traits library. Visual
+      C++ 6/7.0 has a limited support for arrays: as long as the arrays are of built-in
+      type it should work.
+    </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/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>
+<p>
+      For maximum portability you should follow these guidelines:
+    </p>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+        do not use built-in arrays,
+      </li>
+<li class="listitem">
+        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/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>
+<li class="listitem">
+        do not rely on ADL:
+        <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+            if you overload functions, include that header before the headers in
+            this library,
+          </li>
+<li class="listitem">
+            put all overloads in namespace boost.
+          </li>
+</ul></div>
+</li>
+</ol></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="upgrade/upgrade_from_1_34.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="faq.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,95 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Reference</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="concepts/concept_checking.html" title="Concept Checking">
+<link rel="next" href="reference/overview.html" title="Overview">
+</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="concepts/concept_checking.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="reference/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</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>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section">Overview</span></dt>
+<dt><span class="section"><a href="reference/concept_implementation.html"> Range concept
+      implementation</a></span></dt>
+<dd><dl>
+<dt><span class="section">Synopsis</span></dt>
+<dt><span class="section">Semantics</span></dt>
+</dl></dd>
+<dt><span class="section"> Range Adaptors</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="reference/adaptors/introduction.html"> Introduction
+        and motivation</a></span></dt>
+<dt><span class="section"><a href="reference/adaptors/general_requirements.html"> General
+        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"> 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>
+<dt><span class="section"> counting_range</span></dt>
+<dt><span class="section"> istream_range</span></dt>
+<dt><span class="section"> irange</span></dt>
+</dl></dd>
+<dt><span class="section"> Utilities</span></dt>
+<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
+        member functions and nested types</a></span></dt>
+<dt><span class="section"><a href="reference/extending/method_2.html"> Method 2: provide
+        free-standing functions and specialize metafunctions</a></span></dt>
+<dt><span class="section"><a href="reference/extending/method_3.html"> Method 3: provide
+        range adaptor implementations</a></span></dt>
+</dl></dd>
+</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="concepts/concept_checking.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="reference/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Range Adaptors</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="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>
+<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="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/introduction.html"> Introduction
+        and motivation</a></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>
+<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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,141 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>General Requirements</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="introduction.html" title="Introduction and motivation">
+<link rel="next" href="reference.html" title="Reference">
+</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="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="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="General Requirements">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.adaptors.general_requirements"></a><a class="link" href="general_requirements.html" title="General Requirements"> General
+        Requirements</a>
+</h4></div></div></div>
+<p>
+          In the description of generator expressions, the following notation is
+          used:
+        </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">fwdRng</span></code> is an expression
+            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
+            <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">biRng</span></code> is an expression
+            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
+            <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">rndRng</span></code> is an expression
+            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
+            <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">pred</span></code> is an expression
+            of a type that models <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">bi_pred</span></code> is an expression
+            of a type that models <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">fun</span></code> is an expression
+            of a type that models <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">value</span></code>, <code class="computeroutput"><span class="identifier">new_value</span></code> and <code class="computeroutput"><span class="identifier">old_value</span></code>
+            are objects convertible to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span></code> are integer expressions convertible
+            to <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+</li>
+</ul></div>
+<p>
+          Also note that <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code> must be implicitly convertible to
+          the type arguments to <code class="computeroutput"><span class="identifier">pred</span></code>,
+          <code class="computeroutput"><span class="identifier">bi_pred</span></code> and <code class="computeroutput"><span class="identifier">fun</span></code>.
+        </p>
+<p>
+          Range Category in the following adaptor descriptions refers to the minimum
+          range concept required by the range passed to the adaptor. The resultant
+          range is a model of the same range concept as the input range unless specified
+          otherwise.
+        </p>
+<p>
+          Returned Range Category is the concept of the returned range. In some cases
+          the returned range is of a lesser category than the range passed to the
+          adaptor. For example, the <code class="computeroutput"><span class="identifier">filtered</span></code>
+          adaptor returns only a <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
+          regardless of the input.
+        </p>
+<p>
+          Furthermore, the following rules apply to any expression of the form 
+</p>
+<pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adaptor_generator</span>
+</pre>
+<p>
+        </p>
+<p>
+          1. Applying <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
+          to a range <code class="computeroutput"><span class="identifier">R</span></code> (always left
+          argument) and a range adapter <code class="computeroutput"><span class="identifier">RA</span></code>
+          (always right argument) yields a new range type which may not conform to
+          the same range concept as <code class="computeroutput"><span class="identifier">R</span></code>.
+        </p>
+<p>
+          2. The return-type of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code> is otherwise unspecified.
+        </p>
+<p>
+          3. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
+          is found by Argument Dependent Lookup (ADL) because a range adaptor is
+          implemented in namespace <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span></code>.
+        </p>
+<p>
+          4. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
+          is used to add new behaviour <span class="emphasis"><em><span class="bold"><strong>lazily</strong></span></em></span>
+          and never modifies its left argument.
+        </p>
+<p>
+          5. All iterators extracted from the left argument are extracted using qualified
+          calls to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">()</span></code>
+          and <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">()</span></code>.
+        </p>
+<p>
+          6. In addition to the <code class="computeroutput"><span class="keyword">throw</span></code>-clauses
+          below, <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
+          may throw exceptions as a result of copying iterators. If such copying
+          cannot throw an exception, then neither can the whole expression.
+        </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="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="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,274 @@
+<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.2">
+<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.html" title="Range Adaptors">
+<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>
+<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="../adaptors.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="Introduction and motivation">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.adaptors.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation"> Introduction
+        and motivation</a>
+</h4></div></div></div>
+<p>
+          A <span class="bold"><strong>Range Adaptor</strong></span> 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
+        </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">adaptors</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">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">iostream</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="identifier">boost</span><span class="special">::</span><span class="identifier">copy</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">adaptors</span><span class="special">::</span><span class="identifier">reversed</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> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          the iterators from <code class="computeroutput"><span class="identifier">vec</span></code>
+          are wrapped <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>s.
+          The type of the underlying Range Adapter is not documented because you
+          do not need to know it. All that is relevant is that the expression
+        </p>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
+</pre>
+<p>
+        </p>
+<p>
+          returns a Range Adaptor where the iterator type is now the iterator type
+          of the range <code class="computeroutput"><span class="identifier">vec</span></code> wrapped
+          in <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>. The
+          expression <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span></code> is called an <span class="bold"><strong>Adaptor
+          Generator</strong></span>.
+        </p>
+<p>
+          There are two ways of constructing a range adaptor. The first is by using
+          <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
+          This is my preferred technique, however while discussing range adaptors
+          with others it became clear that some users of the library strongly prefer
+          a more familiar function syntax, so equivalent functions of the present
+          tense form have been added as an alternative syntax. The equivalent to
+          <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+          <span class="identifier">reversed</span></code> is <code class="computeroutput"><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> for example.
+        </p>
+<p>
+          Why do I prefer the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code> syntax? The answer is readability:
+        </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="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">adaptors</span><span class="special">::</span><span class="identifier">reverse</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> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          This might not look so bad, but when we apply several adaptors, it becomes
+          much worse. Just compare
+        </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="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">adaptors</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">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">)</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> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          to
+        </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="identifier">boost</span><span class="special">::</span><span class="identifier">copy</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">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
+                 <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">uniqued</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> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          Furthermore, some of the adaptor generators take arguments themselves and
+          these arguments are expressed with function call notation too. In those
+          situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
+        </p>
+<a name="range.reference.adaptors.introduction.composition_of_adaptors"></a><h6>
+<a name="id567043"></a>
+          <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
+          of Adaptors</a>
+        </h6>
+<p>
+          Range Adaptors are a powerful complement to Range algorithms. The reason
+          is that adaptors are <span class="emphasis"><em><span class="bold"><strong>orthogonal</strong></span></em></span>
+          to algorithms. For example, consider these Range algorithms:
+        </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span></code></li>
+<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">)</span></code></li>
+</ul></div>
+<p>
+          What should we do if we only want to copy an element <code class="computeroutput"><span class="identifier">a</span></code>
+          if it satisfies some predicate, say <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>?
+          And what if we only want to count the elements that satisfy the same predicate?
+          The naive answer would be to use these algorithms:
+        </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span>
+            <span class="identifier">rng</span><span class="special">,</span>
+            <span class="identifier">pred</span><span class="special">,</span>
+            <span class="identifier">out</span> <span class="special">)</span></code></li>
+<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span>
+            <span class="identifier">rng</span><span class="special">,</span>
+            <span class="identifier">pred</span> <span class="special">)</span></code></li>
+</ul></div>
+<p>
+          These algorithms are only defined to maintain a one to one relationship
+          with the standard library algorithms. This approach of adding algorithm
+          suffers a combinatorial explosion. Inevitably many algorithms are missing
+          <code class="computeroutput"><span class="identifier">_if</span></code> variants and there
+          is redundant development overhead for each new algorithm. The Adaptor Generator
+          is the design solution to this problem.
+        </p>
+<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
+<a name="id567347"></a>
+          <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
+          Adaptor alternative to copy_if algorithm</a>
+        </h6>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">);</span>
+</pre>
+<p>
+          can be expressed as 
+</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">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
+<a name="id567512"></a>
+          <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm">Range
+          Adaptor alternative to count_if algorithm</a>
+        </h6>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">);</span>
+</pre>
+<p>
+          can be expressed as 
+</p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</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">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          What this means is that <span class="emphasis"><em><span class="bold"><strong>no</strong></span></em></span>
+          algorithm with the <code class="computeroutput"><span class="identifier">_if</span></code>
+          suffix is needed. Furthermore, it turns out that algorithms with the <code class="computeroutput"><span class="identifier">_copy</span></code> suffix are not needed either. Consider
+          the somewhat misdesigned <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">()</span></code> which may be used as
+        </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="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          With adaptors and algorithms we can express this as
+        </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="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</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">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">));</span>
+</pre>
+<p>
+        </p>
+<p>
+          The latter code has several benefits:
+        </p>
+<p>
+          1. it is more <span class="emphasis"><em><span class="bold"><strong>efficient</strong></span></em></span>
+          because we avoid extra allocations as might happen with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span></code>
+        </p>
+<p>
+          2. it is <span class="emphasis"><em><span class="bold"><strong>flexible</strong></span></em></span>
+          as we can subsequently apply even more adaptors, for example: 
+</p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</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">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
+                          <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          3. it is <span class="emphasis"><em><span class="bold"><strong>safer</strong></span></em></span> because
+          there is no use of an unbounded output iterator.
+        </p>
+<p>
+          In this manner, the <span class="emphasis"><em><span class="bold"><strong>composition</strong></span></em></span>
+          of Range Adaptors has the following consequences:
+        </p>
+<p>
+          1. we no longer need <code class="computeroutput"><span class="identifier">_if</span></code>,
+          <code class="computeroutput"><span class="identifier">_copy</span></code>, <code class="computeroutput"><span class="identifier">_copy_if</span></code>
+          and <code class="computeroutput"><span class="identifier">_n</span></code> variants of algorithms.
+        </p>
+<p>
+          2. we can generate a multitude of new algorithms on the fly, for example,
+          above we generated <code class="computeroutput"><span class="identifier">reverse_replace_copy_if</span><span class="special">()</span></code>
+        </p>
+<p>
+          In other words:
+        </p>
+<p>
+          <span class="bold"><strong>Range Adaptors are to algorithms what algorithms
+          are to containers</strong></span>
+        </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="../adaptors.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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,63 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Reference</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="general_requirements.html" title="General Requirements">
+<link rel="next" href="reference/adjacent_filtered.html" title="adjacent_filtered">
+</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="general_requirements.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="reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Reference">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.adaptors.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="reference/adjacent_filtered.html">
+          adjacent_filtered</a></span></dt>
+<dt><span class="section"> copied</span></dt>
+<dt><span class="section"> filtered</span></dt>
+<dt><span class="section"> indexed</span></dt>
+<dt><span class="section"> indirected</span></dt>
+<dt><span class="section"> map_keys</span></dt>
+<dt><span class="section"> map_values</span></dt>
+<dt><span class="section"> replaced</span></dt>
+<dt><span class="section"><a href="reference/replaced_if.html">
+          replaced_if</a></span></dt>
+<dt><span class="section"> reversed</span></dt>
+<dt><span class="section"> sliced</span></dt>
+<dt><span class="section"> strided</span></dt>
+<dt><span class="section"> tokenized</span></dt>
+<dt><span class="section"><a href="reference/transformed.html">
+          transformed</a></span></dt>
+<dt><span class="section"> uniqued</span></dt>
+</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="general_requirements.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="reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,157 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>adjacent_filtered</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="copied.html" title="copied">
+</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="copied.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="adjacent_filtered">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">
+          adjacent_filtered</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example">
+            adjacent_filtered example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">bi_pred</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filter</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">bi_pred</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range is convertible to both argument types of <code class="computeroutput"><span class="identifier">bi_pred</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">bi_pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
+              is <code class="computeroutput"><span class="keyword">true</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
+              of <code class="computeroutput"><span class="identifier">bi_pred</span></code> might throw.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+              of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
+              and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+</li>
+</ul></div>
+<div class="section" title="adjacent_filtered example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">
+            adjacent_filtered example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">functional</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">not_equal_to</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">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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
+</pre>
+<p>
+          </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="copied.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,156 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>copied</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="adjacent_filtered.html" title="adjacent_filtered">
+<link rel="next" href="filtered.html" title="filtered">
+</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="adjacent_filtered.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="filtered.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="copied">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.copied"></a><a class="link" href="copied.html" title="copied"> copied</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="copied.html#range.reference.adaptors.reference.copied.copied_example">
+            copied example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">copied</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span>
+                      <span class="identifier">m</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">n</span><span class="special">,</span>
+                      <span class="identifier">m</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
+              <span class="special">&lt;=</span> <span class="identifier">n</span>
+              <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
+              <span class="special">&lt;=</span> <span class="identifier">m</span>
+              <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
+              <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returns:</strong></span> A new <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+              that holds the sliced range <code class="computeroutput"><span class="special">[</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span><span class="special">)</span></code>
+              of the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+</ul></div>
+<div class="section" title="copied example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.copied.copied_example"></a><a class="link" href="copied.html#range.reference.adaptors.reference.copied.copied_example" title="copied example">
+            copied example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">copied</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">copied</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">5</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
+</pre>
+<p>
+          </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="adjacent_filtered.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="filtered.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,159 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>filtered</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="copied.html" title="copied">
+<link rel="next" href="indexed.html" title="indexed">
+</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="copied.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="indexed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="filtered">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.filtered"></a><a class="link" href="filtered.html" title="filtered"> filtered</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example">
+            filtered example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filter</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">pred</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+              is <code class="computeroutput"><span class="keyword">true</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
+              of <code class="computeroutput"><span class="identifier">pred</span></code> might throw.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+              Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+              of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
+              and <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a>
+</li>
+</ul></div>
+<div class="section" title="filtered example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.filtered.filtered_example"></a><a class="link" href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example" title="filtered example">
+            filtered example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">filtered</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">struct</span> <span class="identifier">is_even</span>
+<span class="special">{</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="keyword">int</span> <span class="identifier">x</span> <span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">0</span><span class="special">;</span> <span class="special">}</span>
+<span class="special">};</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</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> <span class="string">","</span><span class="special">));</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span>
+</pre>
+<p>
+          </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="copied.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="indexed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,190 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>indexed</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="filtered.html" title="filtered">
+<link rel="next" href="indirected.html" title="indirected">
+</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="filtered.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="indirected.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="indexed">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.indexed"></a><a class="link" href="indexed.html" title="indexed"> indexed</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example">
+            indexed example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indexed</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">index</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Returns:</strong></span> 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 <code class="computeroutput"><span class="identifier">index</span><span class="special">()</span></code>
+              member function that returns the appropriate index for the element
+              in the sequence corresponding with the iterator.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>
+</li>
+</ul></div>
+<div class="section" title="indexed example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.indexed.indexed_example"></a><a class="link" href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example" title="indexed example">
+            indexed example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">indexed</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Iterator</span><span class="special">&gt;</span>
+<span class="keyword">void</span> <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">)</span>
+<span class="special">{</span>
+    <span class="keyword">for</span> <span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">it</span> <span class="special">=</span> <span class="identifier">first</span><span class="special">;</span> <span class="identifier">it</span> <span class="special">!=</span> <span class="identifier">last</span><span class="special">;</span> <span class="special">++</span><span class="identifier">it</span><span class="special">)</span>
+    <span class="special">{</span>
+        <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"Element = "</span> <span class="special">&lt;&lt;</span> <span class="special">*</span><span class="identifier">it</span> <span class="special">&lt;&lt;</span> <span class="string">" Index = "</span> <span class="special">&lt;&lt;</span> <span class="identifier">it</span><span class="special">.</span><span class="identifier">index</span><span class="special">()</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+    <span class="special">}</span>
+<span class="special">}</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
+<span class="keyword">void</span> <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">)</span>
+<span class="special">{</span>
+    <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">));</span>
+<span class="special">}</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Iterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Iterator2</span><span class="special">&gt;</span>
+<span class="keyword">void</span> <span class="identifier">check_element_and_index</span><span class="special">(</span>
+        <span class="identifier">Iterator1</span> <span class="identifier">test_first</span><span class="special">,</span>
+        <span class="identifier">Iterator1</span> <span class="identifier">test_last</span><span class="special">,</span>
+        <span class="identifier">Iterator2</span> <span class="identifier">reference_first</span><span class="special">,</span>
+        <span class="identifier">Iterator2</span> <span class="identifier">reference_last</span><span class="special">)</span>
+<span class="special">{</span>
+    <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">test_first</span><span class="special">,</span> <span class="identifier">test_last</span><span class="special">),</span>
+                       <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">reference_first</span><span class="special">,</span> <span class="identifier">reference_last</span><span class="special">)</span> <span class="special">);</span>
+
+    <span class="keyword">int</span> <span class="identifier">reference_index</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
+
+    <span class="identifier">Iterator1</span> <span class="identifier">test_it</span> <span class="special">=</span> <span class="identifier">test_first</span><span class="special">;</span>
+    <span class="identifier">Iterator2</span> <span class="identifier">reference_it</span> <span class="special">=</span> <span class="identifier">reference_first</span><span class="special">;</span>
+    <span class="keyword">for</span> <span class="special">(;</span> <span class="identifier">test_it</span> <span class="special">!=</span> <span class="identifier">test_last</span><span class="special">;</span> <span class="special">++</span><span class="identifier">test_it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">reference_it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">reference_index</span><span class="special">)</span>
+    <span class="special">{</span>
+        <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="special">*</span><span class="identifier">test_it</span><span class="special">,</span> <span class="special">*</span><span class="identifier">reference_it</span> <span class="special">);</span>
+        <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="identifier">test_it</span><span class="special">.</span><span class="identifier">index</span><span class="special">(),</span> <span class="identifier">reference_index</span> <span class="special">);</span>
+    <span class="special">}</span>
+<span class="special">}</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span><span class="special">;</span>
+
+    <span class="identifier">display_element_and_index</span><span class="special">(</span> <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">indexed</span><span class="special">(</span><span class="number">0</span><span class="special">)</span> <span class="special">);</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="identifier">Element</span> <span class="special">=</span> <span class="number">10</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">0</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">20</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">1</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">30</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">2</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">40</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">3</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">50</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">4</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">60</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">5</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">70</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">6</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">80</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">7</span>
+<span class="identifier">Element</span> <span class="special">=</span> <span class="number">90</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">8</span>
+</pre>
+<p>
+          </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="filtered.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="indirected.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,150 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>indirected</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="indexed.html" title="indexed">
+<link rel="next" href="map_keys.html" title="map_keys">
+</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="indexed.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="map_keys.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="indirected">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.indirected"></a><a class="link" href="indirected.html" title="indirected"> indirected</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example">
+            indirected example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indirected</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indirect</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range defines unary <code class="computeroutput"><span class="keyword">operator</span><span class="special">*()</span></code>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="special">*</span><span class="identifier">y</span></code>
+              where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
+              element in the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>
+</li>
+</ul></div>
+<div class="section" title="indirected example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.indirected.indirected_example"></a><a class="link" href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example" title="indirected example">
+            indirected example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">indirected</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">shared_ptr</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+
+    <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
+
+    <span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
+        <span class="identifier">input</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="keyword">new</span> <span class="keyword">int</span><span class="special">(</span><span class="identifier">i</span><span class="special">)));</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">indirected</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
+</pre>
+<p>
+          </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="indexed.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="map_keys.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,150 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>map_keys</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="indirected.html" title="indirected">
+<link rel="next" href="map_values.html" title="map_values">
+</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="indirected.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="map_values.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="map_keys">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.map_keys"></a><a class="link" href="map_keys.html" title="map_keys"> map_keys</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example">
+            map_keys example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">map_keys</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">keys</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range is an instantiation of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">first</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+              is the corresponding element in the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+</ul></div>
+<div class="section" title="map_keys example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.map_keys.map_keys_example"></a><a class="link" href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example" title="map_keys example">
+            map_keys example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">map</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">map</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+
+    <span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
+    <span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
+        <span class="identifier">input</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">make_pair</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">i</span> <span class="special">*</span> <span class="number">10</span><span class="special">));</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">map_keys</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
+</pre>
+<p>
+          </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="indirected.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="map_values.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,150 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>map_values</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="map_keys.html" title="map_keys">
+<link rel="next" href="replaced.html" title="replaced">
+</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="map_keys.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="replaced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="map_values">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.map_values"></a><a class="link" href="map_values.html" title="map_values"> map_values</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example">
+            map_values example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">map_values</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">values</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range is an instantiation of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">second</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+              is the corresponding element in the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+</ul></div>
+<div class="section" title="map_values example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.map_values.map_values_example"></a><a class="link" href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example" title="map_values example">
+            map_values example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">map</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">map</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+
+    <span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
+    <span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
+        <span class="identifier">input</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">make_pair</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">i</span> <span class="special">*</span> <span class="number">10</span><span class="special">));</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">map_values</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span>
+</pre>
+<p>
+          </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="map_keys.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="replaced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,165 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>replaced</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="map_values.html" title="map_values">
+<link rel="next" href="replaced_if.html" title="replaced_if">
+</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="map_values.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="replaced_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="replaced">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.replaced"></a><a class="link" href="replaced.html" title="replaced"> replaced</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example">
+            replaced example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced</span><span class="special">(</span><span class="identifier">new_value</span><span class="special">,</span>
+                      <span class="identifier">old_value</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replace</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">new_value</span><span class="special">,</span>
+                      <span class="identifier">old_value</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">new_value</span></code> is convertible
+                  to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                  of the range.
+                </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">old_value</span></code> is convertible
+                  to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                  of the range.
+                </li>
+</ul></div>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, the value
+              <code class="computeroutput"><span class="identifier">x</span></code> is equal to the value
+              of <code class="computeroutput"><span class="special">(</span><span class="identifier">y</span>
+              <span class="special">==</span> <span class="identifier">old_value</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
+              <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+              is the corresponding element in the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+              Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+</ul></div>
+<div class="section" title="replaced example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.replaced.replaced_example"></a><a class="link" href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example" title="replaced example">
+            replaced example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">replaced</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">replaced</span><span class="special">(</span><span class="number">2</span><span class="special">,</span> <span class="number">10</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
+</pre>
+<p>
+          </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="map_values.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="replaced_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,170 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>replaced_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="replaced.html" title="replaced">
+<link rel="next" href="reversed.html" title="reversed">
+</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="replaced.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="reversed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="replaced_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.replaced_if"></a><a class="link" href="replaced_if.html" title="replaced_if">
+          replaced_if</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example">
+            replaced_if example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span>
+                      <span class="identifier">new_value</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">pred</span><span class="special">,</span>
+                      <span class="identifier">new_value</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+                  The range <code class="computeroutput"><span class="identifier">value_type</span></code>
+                  is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
+                </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">new_value</span></code> is convertible
+                  to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                  of the range.
+                </li>
+</ul></div>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Postconditions:</strong></span> For all elements
+              <code class="computeroutput"><span class="identifier">x</span></code> in the returned range,
+              the value <code class="computeroutput"><span class="identifier">x</span></code> is equal
+              to the value of <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
+              <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+              is the corresponding element in the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+              Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+</ul></div>
+<div class="section" title="replaced_if example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.replaced_if.replaced_if_example"></a><a class="link" href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example" title="replaced_if example">
+            replaced_if example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">struct</span> <span class="identifier">is_even</span>
+<span class="special">{</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">int</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">0</span><span class="special">;</span> <span class="special">}</span>
+<span class="special">};</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">(),</span> <span class="number">10</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
+</pre>
+<p>
+          </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="replaced.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="reversed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,144 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>reversed</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="replaced_if.html" title="replaced_if">
+<link rel="next" href="sliced.html" title="sliced">
+</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="replaced_if.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="sliced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="reversed">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.reversed"></a><a class="link" href="reversed.html" title="reversed"> reversed</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example">
+            reversed example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Returns:</strong></span> A range whose iterators behave
+              as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+</ul></div>
+<div class="section" title="reversed example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.reversed.reversed_example"></a><a class="link" href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example" title="reversed example">
+            reversed example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">reversed</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">void</span> <span class="identifier">reversed_example_test</span><span class="special">()</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">reversed</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span>
+</pre>
+<p>
+          </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="replaced_if.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="sliced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,154 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>sliced</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="reversed.html" title="reversed">
+<link rel="next" href="strided.html" title="strided">
+</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="reversed.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="strided.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="sliced">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.sliced"></a><a class="link" href="sliced.html" title="sliced"> sliced</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example">
+            sliced example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">sliced</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span>
+                      <span class="identifier">m</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">slice</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">n</span><span class="special">,</span>
+                      <span class="identifier">m</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
+              <span class="special">&lt;=</span> <span class="identifier">n</span>
+              <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
+              <span class="special">&lt;=</span> <span class="identifier">m</span>
+              <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
+              <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returns:</strong></span><code class="computeroutput"><span class="identifier">make_range</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span></code>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+</ul></div>
+<div class="section" title="sliced example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.sliced.sliced_example"></a><a class="link" href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example" title="sliced example">
+            sliced example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">sliced</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">sliced</span><span class="special">(</span><span class="number">2</span><span class="special">,</span> <span class="number">5</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
+</pre>
+<p>
+          </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="reversed.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="strided.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,151 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>strided</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="sliced.html" title="sliced">
+<link rel="next" href="tokenized.html" title="tokenized">
+</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="sliced.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="tokenized.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="strided">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.strided"></a><a class="link" href="strided.html" title="strided"> strided</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="strided.html#range.reference.adaptors.reference.strided.strided_example">
+            strided example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">strided</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">stride</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">n</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
+              <span class="special">&lt;=</span> <span class="identifier">n</span>
+              <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
+              <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returns:</strong></span> A new range based on <code class="computeroutput"><span class="identifier">rng</span></code> where traversal is performed
+              in steps of <code class="computeroutput"><span class="identifier">n</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+</ul></div>
+<div class="section" title="strided example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.strided.strided_example"></a><a class="link" href="strided.html#range.reference.adaptors.reference.strided.strided_example" title="strided example">
+            strided example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">strided</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">strided</span><span class="special">(</span><span class="number">2</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span>
+</pre>
+<p>
+          </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="sliced.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="tokenized.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,147 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>tokenized</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="strided.html" title="strided">
+<link rel="next" href="transformed.html" title="transformed">
+</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="strided.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="transformed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="tokenized">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized"> tokenized</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</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">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</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">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</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">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">flags</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">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
+</pre>
+<p>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">)</span>
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">)</span>
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
+</pre>
+<p>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+                  Let <code class="computeroutput"><span class="identifier">T</span></code> denote <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)&gt;::</span><span class="identifier">type</span></code>,
+                  then <code class="computeroutput"><span class="identifier">regex</span></code> has
+                  the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code> or is implicitly convertible
+                  to one of these types.
+                </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">i</span></code> has the type
+                  <code class="computeroutput"><span class="keyword">int</span></code>.
+                </li>
+<li class="listitem">
+                  the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                  of <code class="computeroutput"><span class="identifier">rndRng</span></code> is <code class="computeroutput"><span class="keyword">int</span></code>.
+                </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">flags</span></code> has the type
+                  <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
+                </li>
+</ul></div>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returns:</strong></span> A range whose iterators behave
+              as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>.
+              The first iterator in the range would be constructed by forwarding
+              all the arguments of <code class="computeroutput"><span class="identifier">tokenized</span><span class="special">()</span></code> to the <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>
+              constructor.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Throws:</strong></span> Whatever constructing and
+              copying equivalent <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>s
+              might throw.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a>
+</li>
+</ul></div>
+</div>
+<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="strided.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="transformed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,161 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>transformed</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="tokenized.html" title="tokenized">
+<link rel="next" href="uniqued.html" title="uniqued">
+</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="tokenized.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="uniqued.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="transformed">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.transformed"></a><a class="link" href="transformed.html" title="transformed">
+          transformed</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example">
+            transformed example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">transformed</span><span class="special">(</span><span class="identifier">fun</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">transform</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">fun</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range is convertible to the argument type of <code class="computeroutput"><span class="identifier">fun</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span></code>
+              where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
+              element in the original range.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Throws:</strong></span> Whatever the copy-constructor
+              of <code class="computeroutput"><span class="identifier">fun</span></code> might throw.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The range
+              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+</ul></div>
+<div class="section" title="transformed example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.transformed.transformed_example"></a><a class="link" href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example" title="transformed example">
+            transformed example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">transformed</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">struct</span> <span class="identifier">double_int</span>
+<span class="special">{</span>
+    <span class="keyword">typedef</span> <span class="keyword">int</span> <span class="identifier">result_type</span><span class="special">;</span>
+    <span class="keyword">int</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">int</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">*</span> <span class="number">2</span><span class="special">;</span> <span class="special">}</span>
+<span class="special">};</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">transformed</span><span class="special">(</span><span class="identifier">double_int</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> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span>
+</pre>
+<p>
+          </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="tokenized.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="uniqued.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,147 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>uniqued</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="transformed.html" title="transformed">
+<link rel="next" href="../../algorithms.html" title="Range Algorithm">
+</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="transformed.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="uniqued">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.adaptors.reference.uniqued"></a><a class="link" href="uniqued.html" title="uniqued"> uniqued</a>
+</h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example">
+            uniqued example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">uniqued</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
+              of the range is comparable with <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span><span class="special">==</span><span class="identifier">y</span></code> is false.
+            </li>
+<li class="listitem">
+<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+              Range</a>
+</li>
+<li class="listitem">
+<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+              of the range concept of <code class="computeroutput"><span class="identifier">rng</span></code>
+              and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
+            </li>
+</ul></div>
+<div class="section" title="uniqued example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.uniqued.uniqued_example"></a><a class="link" href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example" title="uniqued example">
+            uniqued example</a>
+</h6></div></div></div>
+<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">adaptor</span><span class="special">/</span><span class="identifier">uniqued</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">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</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">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</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="keyword">void</span> <span class="identifier">uniqued_example_test</span><span class="special">()</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</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">input</span><span class="special">;</span>
+    <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">;</span>
+
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">uniqued</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> <span class="string">","</span><span class="special">));</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output: 
+</p>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
+</pre>
+<p>
+          </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="transformed.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,56 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Range Algorithm</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/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">
+<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="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">
+<a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithm"> Range Algorithm</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="algorithms/range_algorithm_introduction.html">
+        Introduction and motivation</a></span></dt>
+<dt><span class="section"> Mutating algorithms</span></dt>
+<dt><span class="section"><a href="algorithms/non_mutating.html"> Non-mutating
+        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>
+<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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,49 @@
+<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.2">
+<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/set_symmetric_difference.html" title="set_symmetric_difference">
+<link rel="next" href="heap/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/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/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"></a><a class="link" href="heap.html" title="Heap algorithms"> Heap algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> push_heap</span></dt>
+<dt><span class="section"> pop_heap</span></dt>
+<dt><span class="section"> make_heap</span></dt>
+<dt><span class="section"> sort_heap</span></dt>
+</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/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/push_heap.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,143 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>make_heap</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../heap.html" title="Heap algorithms">
+<link rel="prev" href="pop_heap.html" title="pop_heap">
+<link rel="next" href="sort_heap.html" title="sort_heap">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<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="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="make_heap">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.heap.make_heap"></a><a class="link" href="make_heap.html" title="make_heap"> make_heap</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.heap.make_heap.prototype"></a><h6>
+<a name="id644655"></a>
+            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
+<a name="id645027"></a>
+            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">make_heap</span></code> turns <code class="computeroutput"><span class="identifier">rng</span></code> into a heap.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
+<a name="id645105"></a>
+            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.heap.make_heap.requirements"></a><h6>
+<a name="id645176"></a>
+            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
+<a name="id645408"></a>
+            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
+            <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            comparisons.
+          </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="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,155 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>pop_heap</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../heap.html" title="Heap algorithms">
+<link rel="prev" href="push_heap.html" title="push_heap">
+<link rel="next" href="make_heap.html" title="make_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="push_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.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="make_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="pop_heap">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.heap.pop_heap"></a><a class="link" href="pop_heap.html" title="pop_heap"> pop_heap</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.heap.pop_heap.prototype"></a><h6>
+<a name="id643669"></a>
+            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
+<a name="id644042"></a>
+            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">pop_heap</span></code> removes the
+            largest element from the heap. It is assumed that <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is already a heap and that the element
+            to be added is <code class="computeroutput"><span class="special">*</span><span class="identifier">prior</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>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
+<a name="id644197"></a>
+            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.heap.pop_heap.requirements"></a><h6>
+<a name="id644267"></a>
+            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
+<a name="id644498"></a>
+            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code></li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
+<a name="id644568"></a>
+            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
+          </h6>
+<p>
+            Logarithmic. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
+            <span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
+            comparisons.
+          </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="push_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.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="make_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,153 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>push_heap</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../heap.html" title="Heap algorithms">
+<link rel="prev" href="../heap.html" title="Heap algorithms">
+<link rel="next" href="pop_heap.html" title="pop_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="../heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.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="pop_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="push_heap">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.heap.push_heap"></a><a class="link" href="push_heap.html" title="push_heap"> push_heap</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.heap.push_heap.prototype"></a><h6>
+<a name="id642645"></a>
+            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
+<a name="id643017"></a>
+            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">push_heap</span></code> adds an element
+            to a heap. It is assumed that <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is already a heap and that the element
+            to be added is <code class="computeroutput"><span class="special">*</span><span class="identifier">prior</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>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
+<a name="id643177"></a>
+            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.heap.push_heap.requirements"></a><h6>
+<a name="id643248"></a>
+            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
+<a name="id643479"></a>
+            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code></li>
+<li class="listitem">
+<code class="computeroutput"><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">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)))</span></code> is a heap.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
+<a name="id643593"></a>
+            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
+          </h6>
+<p>
+            Logarithmic. At most <code class="computeroutput"><span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> comparisons.
+          </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="../heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.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="pop_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,152 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>sort_heap</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../heap.html" title="Heap algorithms">
+<link rel="prev" href="make_heap.html" title="make_heap">
+<link rel="next" href="../permutation.html" title="Permutation algorithms">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="sort_heap">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.heap.sort_heap"></a><a class="link" href="sort_heap.html" title="sort_heap"> sort_heap</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.heap.sort_heap.prototype"></a><h6>
+<a name="id645485"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
+<a name="id645856"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">sort_heap</span></code> turns a heap
+            into a sorted range.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
+<a name="id645923"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.heap.sort_heap.requirements"></a><h6>
+<a name="id645993"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
+<a name="id646225"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
+          </p>
+<a name="range.reference.algorithms.heap.sort_heap.complexity"></a><h6>
+<a name="id646261"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
+          </h6>
+<p>
+            At most <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
+            <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            comparisons, where <code class="computeroutput"><span class="identifier">N</span></code>
+            is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,91 @@
+<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.2">
+<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="mutating/copy.html" title="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="mutating/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.mutating"></a><a class="link" href="mutating.html" title="Mutating algorithms"> Mutating algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> copy</span></dt>
+<dt><span class="section"><a href="mutating/copy_backward.html">
+          copy_backward</a></span></dt>
+<dt><span class="section"> fill</span></dt>
+<dt><span class="section"> fill_n</span></dt>
+<dt><span class="section"> generate</span></dt>
+<dt><span class="section"><a href="mutating/inplace_merge.html">
+          inplace_merge</a></span></dt>
+<dt><span class="section"> merge</span></dt>
+<dt><span class="section"><a href="mutating/nth_element.html">
+          nth_element</a></span></dt>
+<dt><span class="section"><a href="mutating/partial_sort.html">
+          partial_sort</a></span></dt>
+<dt><span class="section"> partition</span></dt>
+<dt><span class="section"><a href="mutating/random_shuffle.html">
+          random_shuffle</a></span></dt>
+<dt><span class="section"> remove</span></dt>
+<dt><span class="section"><a href="mutating/remove_copy.html">
+          remove_copy</a></span></dt>
+<dt><span class="section"><a href="mutating/remove_copy_if.html">
+          remove_copy_if</a></span></dt>
+<dt><span class="section"> remove_if</span></dt>
+<dt><span class="section"> replace</span></dt>
+<dt><span class="section"><a href="mutating/replace_copy.html">
+          replace_copy</a></span></dt>
+<dt><span class="section"><a href="mutating/replace_copy_if.html">
+          replace_copy_if</a></span></dt>
+<dt><span class="section"><a href="mutating/replace_if.html">
+          replace_if</a></span></dt>
+<dt><span class="section"> reverse</span></dt>
+<dt><span class="section"><a href="mutating/reverse_copy.html">
+          reverse_copy</a></span></dt>
+<dt><span class="section"> rotate</span></dt>
+<dt><span class="section"><a href="mutating/rotate_copy.html">
+          rotate_copy</a></span></dt>
+<dt><span class="section"> sort</span></dt>
+<dt><span class="section"><a href="mutating/stable_partition.html">
+          stable_partition</a></span></dt>
+<dt><span class="section"><a href="mutating/stable_sort.html">
+          stable_sort</a></span></dt>
+<dt><span class="section"><a href="mutating/swap_ranges.html">
+          swap_ranges</a></span></dt>
+<dt><span class="section"> transform</span></dt>
+<dt><span class="section"> unique</span></dt>
+<dt><span class="section"><a href="mutating/unique_copy.html">
+          unique_copy</a></span></dt>
+</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="mutating/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,115 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>copy</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="../mutating.html" title="Mutating algorithms">
+<link rel="next" href="copy_backward.html" title="copy_backward">
+</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="../mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.copy"></a><a class="link" href="copy.html" title="copy"> copy</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.copy.prototype"></a><h6>
+<a name="id587769"></a>
+            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.copy.description"></a><h6>
+<a name="id587896"></a>
+            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">copy</span></code> copies all elements
+            from <code class="computeroutput"><span class="identifier">source_rng</span></code> to the
+            range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
+            <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code>. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">+</span>
+            <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.copy.definition"></a><h6>
+<a name="id588025"></a>
+            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.copy.requirements"></a><h6>
+<a name="id588096"></a>
+            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
+              <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+              Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
+<a name="id588202"></a>
+            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
+              within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
+              <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
+<a name="id588303"></a>
+            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="../mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,125 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>copy_backward</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="copy.html" title="copy">
+<link rel="next" href="fill.html" title="fill">
+</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="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="copy_backward">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.copy_backward"></a><a class="link" href="copy_backward.html" title="copy_backward">
+          copy_backward</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.copy_backward.prototype"></a><h6>
+<a name="id588372"></a>
+            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.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">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BidirectionalOutputIterator</span><span class="special">&gt;</span>
+    <span class="identifier">BidirectionalOutputIterator</span>
+        <span class="identifier">copy_backward</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
+                      <span class="identifier">BidirectionalOutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
+<a name="id588499"></a>
+            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">copy_backward</span></code> copies
+            all elements from <code class="computeroutput"><span class="identifier">source_rng</span></code>
+            to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span>
+            <span class="special">-</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>.
+          </p>
+<p>
+            The values are copied in reverse order. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">-</span>
+            <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
+          </p>
+<p>
+            Note well that unlike all other standard algorithms <code class="computeroutput"><span class="identifier">out_it</span></code>
+            denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
+          </p>
+<a name="range.reference.algorithms.mutating.copy_backward.definition"></a><h6>
+<a name="id588654"></a>
+            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.copy_backward.requirements"></a><h6>
+<a name="id588724"></a>
+            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
+              <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
+              Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
+<a name="id588831"></a>
+            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
+              within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
+              <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
+<a name="id588932"></a>
+            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,101 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>fill</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="copy_backward.html" title="copy_backward">
+<link rel="next" href="fill_n.html" title="fill_n">
+</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="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="fill">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.fill"></a><a class="link" href="fill.html" title="fill"> fill</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.fill.prototype"></a><h6>
+<a name="id589000"></a>
+            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.fill.description"></a><h6>
+<a name="id589137"></a>
+            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">fill</span></code> assigns the value
+            <code class="computeroutput"><span class="identifier">val</span></code> to every element
+            in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.fill.definition"></a><h6>
+<a name="id589192"></a>
+            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.fill.requirements"></a><h6>
+<a name="id589262"></a>
+            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
+<a name="id589373"></a>
+            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,101 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>fill_n</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="fill.html" title="fill">
+<link rel="next" href="generate.html" title="generate">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="fill_n">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.fill_n"></a><a class="link" href="fill_n.html" title="fill_n"> fill_n</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.fill_n.prototype"></a><h6>
+<a name="id589440"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
+<a name="id589608"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">fill_n</span></code> assigns the value
+            <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> begining with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.fill_n.definition"></a><h6>
+<a name="id589706"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.fill_n.requirements"></a><h6>
+<a name="id589776"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
+<a name="id589887"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> assignments
+            are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,120 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>generate</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="fill_n.html" title="fill_n">
+<link rel="next" href="inplace_merge.html" title="inplace_merge">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="generate">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.generate"></a><a class="link" href="generate.html" title="generate"> generate</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.generate.prototype"></a><h6>
+<a name="id589941"></a>
+            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">generate</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span> <span class="identifier">gen</span> <span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">generate</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span> <span class="identifier">gen</span> <span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.generate.description"></a><h6>
+<a name="id590176"></a>
+            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">generate</span></code> assigns the
+            result of <code class="computeroutput"><span class="identifier">gen</span><span class="special">()</span></code>
+            to each element in range <code class="computeroutput"><span class="identifier">rng</span></code>.
+            Returns the resultant range.
+          </p>
+<a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
+<a name="id590238"></a>
+            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">generate</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.generate.requirements"></a><h6>
+<a name="id590308"></a>
+            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Generator</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">GeneratorConcept</span></code>.
+            </li>
+<li class="listitem">
+              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
+              <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
+<a name="id590429"></a>
+            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
+              within <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
+              <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
+<a name="id590530"></a>
+            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,187 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>inplace_merge</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="generate.html" title="generate">
+<link rel="next" href="merge.html" title="merge">
+</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="generate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="inplace_merge">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.inplace_merge"></a><a class="link" href="inplace_merge.html" title="inplace_merge">
+          inplace_merge</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a><h6>
+<a name="id590598"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.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">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
+<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+               <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span> <span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
+<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+               <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span> <span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
+<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+               <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+               <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
+<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+               <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+               <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
+<a name="id591148"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">inplace_merge</span></code> combines
+            two consecutive sorted ranges <code class="computeroutput"><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">middle</span><span class="special">)</span></code>
+            and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> into a single sorted range <code class="computeroutput"><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">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. That is, it starts with a range <code class="computeroutput"><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">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> that consists o
f two pieces each of
+            which is in ascending order, and rearranges it so that the entire range
+            is in ascending order. <code class="computeroutput"><span class="identifier">inplace_merge</span></code>
+            is stable, meaning both that the relative order of elements within each
+            input range is preserved.
+          </p>
+<a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
+<a name="id591366"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.inplace_merge.requirements"></a><h6>
+<a name="id591437"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+</li>
+<li class="listitem">
+              The ordering on objects of <code class="computeroutput"><span class="identifier">range_type</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate version:</strong></span> * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code> is a model of the
+            <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
+            Concept. * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+            is mutable. * <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
+            is a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+            value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+            argument types.
+          </p>
+<a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
+<a name="id591686"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
+          </h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a><h6>
+<a name="id591710"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
+            the non-predicate version:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">middle</span></code> is in the range
+              <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><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">middle</span><span class="special">)</span></code> is in ascending order. That is for
+              each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
+              <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+              <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is in ascending order. That is for
+              each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
+              <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+              <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
+<a name="id591962"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
+            the predicate version:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">middle</span></code> is in the range
+              <code class="computeroutput"><span class="identifier">rng</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><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">middle</span><span class="special">)</span></code> is in ascending order. That is for
+              each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
+              <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is in ascending order. That is for
+              each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
+              <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
+<a name="id592234"></a>
+            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
+          </h6>
+<p>
+            Worst case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code>
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="generate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,246 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>merge</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="inplace_merge.html" title="inplace_merge">
+<link rel="next" href="nth_element.html" title="nth_element">
+</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="inplace_merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="nth_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="merge">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.merge"></a><a class="link" href="merge.html" title="merge"> merge</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.merge.prototype"></a><h6>
+<a name="id592315"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">merge</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                     <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                     <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">merge</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                     <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                     <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
+                     <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.merge.description"></a><h6>
+<a name="id592657"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">merge</span></code> combines two sorted
+            ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> into a single sorted range by
+            copying elements. <code class="computeroutput"><span class="identifier">merge</span></code>
+            is stable. The return value is <code class="computeroutput"><span class="identifier">out</span>
+            <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+<p>
+            The two versions of <code class="computeroutput"><span class="identifier">merge</span></code>
+            differ by how they compare the elements.
+          </p>
+<p>
+            The non-predicate version uses the <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code> for the range value type. The predicate
+            version uses the predicate instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.merge.definition"></a><h6>
+<a name="id592834"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.merge.requirements"></a><h6>
+<a name="id592905"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering on objects of <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
+              <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s set
+              of value types.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
+              <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s set
+              of value types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
+<a name="id593398"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
+          </h6>
+<a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a><h6>
+<a name="id593422"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
+            the non-predicate version:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+              The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
+              are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> of <code class="computeroutput"><span class="identifier">rng1</span></code>,
+              <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+              <span class="identifier">x</span> <span class="special">==</span>
+              <span class="keyword">false</span></code>.
+            </li>
+<li class="listitem">
+              The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
+              are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> of <code class="computeroutput"><span class="identifier">rng2</span></code>,
+              <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+              <span class="identifier">x</span> <span class="special">==</span>
+              <span class="keyword">false</span></code>.
+            </li>
+<li class="listitem">
+              The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+              do not overlap.
+            </li>
+<li class="listitem">
+              The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+              do not overlap.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+              is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
+<a name="id593869"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
+            the predicate version:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+              The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
+              are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, of <code class="computeroutput"><span class="identifier">rng1</span></code>,
+              <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
+            </li>
+<li class="listitem">
+              The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
+              are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, of <code class="computeroutput"><span class="identifier">rng2</span></code>,
+              <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
+            </li>
+<li class="listitem">
+              The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+              do not overlap.
+            </li>
+<li class="listitem">
+              The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
+              <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+              do not overlap.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+              is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
+<a name="id594608"></a>
+            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. There are no comparisons if both <code class="computeroutput"><span class="identifier">rng1</span></code>
+            and <code class="computeroutput"><span class="identifier">rng2</span></code> are empty, otherwise
+            at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            comparisons.
+          </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="inplace_merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="nth_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,151 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>nth_element</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="merge.html" title="merge">
+<link rel="next" href="partial_sort.html" title="partial_sort">
+</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="merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="partial_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="nth_element">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.nth_element"></a><a class="link" href="nth_element.html" title="nth_element">
+          nth_element</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.nth_element.prototype"></a><h6>
+<a name="id594731"></a>
+            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
+<a name="id595245"></a>
+            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">nth_element</span></code> partially
+            orders a range of elements. <code class="computeroutput"><span class="identifier">nth_element</span></code>
+            arranges the range <code class="computeroutput"><span class="identifier">rng</span></code>
+            such that the element corresponding with the iterator <code class="computeroutput"><span class="identifier">nth</span></code>
+            is the same as the element that would be in that position if <code class="computeroutput"><span class="identifier">rng</span></code> has been sorted.
+          </p>
+<a name="range.reference.algorithms.mutating.nth_element.definition"></a><h6>
+<a name="id595324"></a>
+            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">nth_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.nth_element.requirements"></a><h6>
+<a name="id595394"></a>
+            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
+<a name="id595625"></a>
+            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
+          </h6>
+<p>
+            On average, linear in <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="partial_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,156 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>partial_sort</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="nth_element.html" title="nth_element">
+<link rel="next" href="partition.html" title="partition">
+</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="nth_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="partial_sort">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.partial_sort"></a><a class="link" href="partial_sort.html" title="partial_sort">
+          partial_sort</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.partial_sort.prototype"></a><h6>
+<a name="id595691"></a>
+            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+    <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+    <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
+<a name="id596205"></a>
+            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">partial_sort</span></code> rearranges
+            the elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
+            It places the smallest <code class="computeroutput"><span class="identifier">distance</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">middle</span><span class="special">)</span></code> elements, sorted in ascending order,
+            into the range <code class="computeroutput"><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">middle</span><span class="special">)</span></code>. The remaining elements are placed in
+            an unspecified order into <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">last</span><span class="special">)</span></code>.
+          </p>
+<p>
+            The non-predicative versions of this function specify that one element
+            is less than another by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>. The predicate versions use the
+            predicate instead.
+          </p>
+<a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
+<a name="id596384"></a>
+            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.partial_sort.requirements"></a><h6>
+<a name="id596454"></a>
+            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate version:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
+<a name="id596685"></a>
+            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
+          </h6>
+<p>
+            Approximately <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</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">middle</span><span class="special">))</span></code> comparisons.
+          </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="nth_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,132 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>partition</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="partial_sort.html" title="partial_sort">
+<link rel="next" href="random_shuffle.html" title="random_shuffle">
+</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="partial_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="random_shuffle.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="partition">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition"> partition</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.partition.prototype"></a><h6>
+<a name="id596801"></a>
+            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.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">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.partition.description"></a><h6>
+<a name="id597367"></a>
+            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">partition</span></code> orders the
+            elements in <code class="computeroutput"><span class="identifier">rng</span></code> based
+            on <code class="computeroutput"><span class="identifier">pred</span></code>, such that the
+            elements that satisfy <code class="computeroutput"><span class="identifier">pred</span></code>
+            precede the elements that do not. In the versions that return a single
+            iterator, the return value is the middle iterator. In the versions that
+            have a configurable range_return, <code class="computeroutput"><span class="identifier">found</span></code>
+            corresponds to the middle iterator.
+          </p>
+<a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
+<a name="id597448"></a>
+            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.partition.requirements"></a><h6>
+<a name="id597519"></a>
+            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
+              argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
+<a name="id597615"></a>
+            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">pred</span></code>,
+            and at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
+            swaps.
+          </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="partial_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="random_shuffle.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,132 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>random_shuffle</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="partition.html" title="partition">
+<link rel="next" href="remove.html" title="remove">
+</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="partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="random_shuffle">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.random_shuffle"></a><a class="link" href="random_shuffle.html" title="random_shuffle">
+          random_shuffle</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a><h6>
+<a name="id597726"></a>
+            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span><span class="special">&amp;</span> <span class="identifier">gen</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span><span class="special">&amp;</span> <span class="identifier">gen</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
+<a name="id598106"></a>
+            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">random_shuffle</span></code> randomly
+            rearranges the elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
+            The versions of <code class="computeroutput"><span class="identifier">random_shuffle</span></code>
+            that do not specify a <code class="computeroutput"><span class="identifier">Generator</span></code>
+            use an internal random number generator. The versions of <code class="computeroutput"><span class="identifier">random_shuffle</span></code> that do specify a <code class="computeroutput"><span class="identifier">Generator</span></code> use this instead. Returns
+            the shuffles range.
+          </p>
+<a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
+<a name="id598198"></a>
+            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.random_shuffle.requirements"></a><h6>
+<a name="id598269"></a>
+            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the version without a Generator:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li></ul></div>
+<p>
+            <span class="bold"><strong>For the version with a Generator:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Generator</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">RandomNumberGeneratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              distance type is convertible to <code class="computeroutput"><span class="identifier">Generator</span></code>'s
+              argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
+<a name="id598414"></a>
+            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+              is less than <code class="computeroutput"><span class="identifier">gen</span></code>'s
+              maximum value.
+            </li></ul></div>
+<a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
+<a name="id598475"></a>
+            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. If <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            swaps are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,138 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>remove</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="random_shuffle.html" title="random_shuffle">
+<link rel="next" href="remove_copy.html" title="remove_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="random_shuffle.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="remove">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.remove"></a><a class="link" href="remove.html" title="remove"> remove</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.remove.prototype"></a><h6>
+<a name="id598580"></a>
+            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.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">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.remove.description"></a><h6>
+<a name="id599184"></a>
+            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">remove</span></code> removes from
+            <code class="computeroutput"><span class="identifier">rng</span></code> all of the elements
+            <code class="computeroutput"><span class="identifier">x</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
+            The versions of <code class="computeroutput"><span class="identifier">remove</span></code>
+            that return an iterator, return an iterator <code class="computeroutput"><span class="identifier">new_last</span></code>
+            such that the range <code class="computeroutput"><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">new_last</span><span class="special">)</span></code> contains no elements equal to <code class="computeroutput"><span class="identifier">val</span></code>. The <code class="computeroutput"><span class="identifier">range_return</span></code>
+            versions of <code class="computeroutput"><span class="identifier">remove</span></code> defines
+            <code class="computeroutput"><span class="identifier">found</span></code> as the new last
+            element. The iterators in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span>
+            <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
+            are dereferenceable, but the elements are unspecified.
+          </p>
+<a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
+<a name="id599413"></a>
+            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.remove.requirements"></a><h6>
+<a name="id599484"></a>
+            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
+<a name="id599595"></a>
+            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">remove</span></code> performs
+            exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            comparisons for equality.
+          </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="random_shuffle.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,109 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>remove_copy</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="remove.html" title="remove">
+<link rel="next" href="remove_copy_if.html" title="remove_copy_if">
+</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="remove.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="remove_copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.remove_copy"></a><a class="link" href="remove_copy.html" title="remove_copy">
+          remove_copy</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.remove_copy.prototype"></a><h6>
+<a name="id599672"></a>
+            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span>
+<span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span>
+<span class="identifier">remove_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
+<a name="id599969"></a>
+            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_copy</span></code> copied all
+            of the elements <code class="computeroutput"><span class="identifier">x</span></code> from
+            <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.remove_copy.definition"></a><h6>
+<a name="id600056"></a>
+            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.remove_copy.requirements"></a><h6>
+<a name="id600125"></a>
+            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
+<a name="id600237"></a>
+            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">remove_copy</span></code> performs
+            exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            comparisons for equality.
+          </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="remove.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,104 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>remove_copy_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="remove_copy.html" title="remove_copy">
+<link rel="next" href="remove_if.html" title="remove_if">
+</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="remove_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="remove_copy_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.remove_copy_if"></a><a class="link" href="remove_copy_if.html" title="remove_copy_if">
+          remove_copy_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a><h6>
+<a name="id600315"></a>
+            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span>
+<span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">UnaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span>
+<span class="identifier">remove_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">UnaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
+<a name="id600592"></a>
+            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_copy_if</span></code> copied
+            all of the elements <code class="computeroutput"><span class="identifier">x</span></code>
+            from <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">false</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a><h6>
+<a name="id600681"></a>
+            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a><h6>
+<a name="id600752"></a>
+            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPred</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
+<a name="id600838"></a>
+            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">remove_copy_if</span></code>
+            performs exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons with UnaryPred.
+          </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="remove_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="remove_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,137 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>remove_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="remove_copy_if.html" title="remove_copy_if">
+<link rel="next" href="replace.html" title="replace">
+</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="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="remove_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.remove_if"></a><a class="link" href="remove_if.html" title="remove_if"> remove_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.remove_if.prototype"></a><h6>
+<a name="id600915"></a>
+            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.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">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
+<a name="id601479"></a>
+            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_if</span></code> removes from
+            <code class="computeroutput"><span class="identifier">rng</span></code> all of the elements
+            <code class="computeroutput"><span class="identifier">x</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>. The versions of
+            <code class="computeroutput"><span class="identifier">remove_if</span></code> that return
+            an iterator, return an iterator <code class="computeroutput"><span class="identifier">new_last</span></code>
+            such that the range <code class="computeroutput"><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">new_last</span><span class="special">)</span></code> contains no elements where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>. The iterators in
+            the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> are dereferenceable, but the elements
+            are unspecified.
+          </p>
+<a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
+<a name="id601702"></a>
+            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.remove_if.requirements"></a><h6>
+<a name="id601774"></a>
+            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
+              argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
+<a name="id601885"></a>
+            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">remove_if</span></code> performs
+            exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            applications of <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,118 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>replace</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="remove_if.html" title="remove_if">
+<link rel="next" href="replace_copy.html" title="replace_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="remove_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="replace">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.replace"></a><a class="link" href="replace.html" title="replace"> replace</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.replace.prototype"></a><h6>
+<a name="id601973"></a>
+            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.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">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">what</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">what</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.replace.description"></a><h6>
+<a name="id602279"></a>
+            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">replace</span></code> every element
+            in <code class="computeroutput"><span class="identifier">rng</span></code> equal to <code class="computeroutput"><span class="identifier">what</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
+            Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.replace.definition"></a><h6>
+<a name="id602356"></a>
+            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.replace.requirements"></a><h6>
+<a name="id602427"></a>
+            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
+              and may be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
+<a name="id602574"></a>
+            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">replace</span></code> performs
+            exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            comparisons for equality and at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments.
+          </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="remove_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,112 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>replace_copy</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="replace.html" title="replace">
+<link rel="next" href="replace_copy_if.html" title="replace_copy_if">
+</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="replace.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="replace_copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.replace_copy"></a><a class="link" href="replace_copy.html" title="replace_copy">
+          replace_copy</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.replace_copy.prototype"></a><h6>
+<a name="id602676"></a>
+            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">replace_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
+                            <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">what</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
+<a name="id602868"></a>
+            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">replace_copy</span></code> copy every
+            element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> such that the corresponding element
+            in the output range <code class="computeroutput"><span class="identifier">y</span></code>
+            is <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span>
+            <span class="identifier">what</span> <span class="special">?</span>
+            <span class="identifier">with_what</span> <span class="special">:</span>
+            <span class="identifier">x</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
+<a name="id602979"></a>
+            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.replace_copy.requirements"></a><h6>
+<a name="id603050"></a>
+            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
+<a name="id603185"></a>
+            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">replace_copy</span></code>
+            performs exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="replace.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,114 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>replace_copy_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="replace_copy.html" title="replace_copy">
+<link rel="next" href="replace_if.html" title="replace_if">
+</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="replace_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="replace_copy_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.replace_copy_if"></a><a class="link" href="replace_copy_if.html" title="replace_copy_if">
+          replace_copy_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a><h6>
+<a name="id603264"></a>
+            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">replace_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
+                               <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
+<a name="id603462"></a>
+            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">replace_copy_if</span></code> copy
+            every element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> such that the corresponding element
+            in the output range <code class="computeroutput"><span class="identifier">y</span></code>
+            is <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">with_what</span>
+            <span class="special">:</span> <span class="identifier">x</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a><h6>
+<a name="id603575"></a>
+            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a><h6>
+<a name="id603648"></a>
+            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
+<a name="id603808"></a>
+            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">replace_copy_if</span></code>
+            performs exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> evaluations of <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="replace_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="replace_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,117 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>replace_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="replace_copy_if.html" title="replace_copy_if">
+<link rel="next" href="reverse.html" title="reverse">
+</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="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="reverse.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="replace_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.replace_if"></a><a class="link" href="replace_if.html" title="replace_if">
+          replace_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.replace_if.prototype"></a><h6>
+<a name="id603895"></a>
+            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
+<a name="id604208"></a>
+            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">replace_if</span></code> replaces every
+            element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">true</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
+            Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.replace_if.definition"></a><h6>
+<a name="id604320"></a>
+            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.replace_if.requirements"></a><h6>
+<a name="id604390"></a>
+            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
+              argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
+<a name="id604550"></a>
+            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">replace_if</span></code> performs
+            exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            applications of <code class="computeroutput"><span class="identifier">pred</span></code>,
+            and at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments.
+          </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="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="reverse.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,96 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>reverse</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="replace_if.html" title="replace_if">
+<link rel="next" href="reverse_copy.html" title="reverse_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="replace_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="reverse_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="reverse">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.reverse"></a><a class="link" href="reverse.html" title="reverse"> reverse</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.reverse.prototype"></a><h6>
+<a name="id604661"></a>
+            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.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">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">reverse</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">reverse</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
+<a name="id604832"></a>
+            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">reverse</span></code> reverses a range.
+            Returns a reference to the reversed range.
+          </p>
+<a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
+<a name="id604870"></a>
+            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.reverse.requirements"></a><h6>
+<a name="id604941"></a>
+            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
+<a name="id605003"></a>
+            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">reverse</span></code> makes
+            <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)/</span><span class="number">2</span></code> calls to <code class="computeroutput"><span class="identifier">iter_swap</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="replace_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="reverse_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,101 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>reverse_copy</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="reverse.html" title="reverse">
+<link rel="next" href="rotate.html" title="rotate">
+</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="reverse.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="rotate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="reverse_copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.reverse_copy"></a><a class="link" href="reverse_copy.html" title="reverse_copy">
+          reverse_copy</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a><h6>
+<a name="id605097"></a>
+            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.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">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">reverse_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
+<a name="id605224"></a>
+            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">reverse_copy</span></code> copies the
+            elements from <code class="computeroutput"><span class="identifier">rng</span></code> in
+            reverse order to <code class="computeroutput"><span class="identifier">out</span></code>.
+            Returns the output iterator one passed the last copied element.
+          </p>
+<a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
+<a name="id605281"></a>
+            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a><h6>
+<a name="id605352"></a>
+            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
+<a name="id605439"></a>
+            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">reverse_copy</span></code>
+            makes <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            copies.
+          </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="reverse.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="rotate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,109 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>rotate</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="reverse_copy.html" title="reverse_copy">
+<link rel="next" href="rotate_copy.html" title="rotate_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="reverse_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="rotate_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="rotate">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.rotate"></a><a class="link" href="rotate.html" title="rotate"> rotate</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.rotate.prototype"></a><h6>
+<a name="id605516"></a>
+            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.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">ForwardRange</span><span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rotate</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+                     <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rotate</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+                           <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
+<a name="id605769"></a>
+            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">rotate</span></code> rotates the elements
+            in a range. It exchanges the two ranges <code class="computeroutput"><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">middle</span><span class="special">)</span></code>
+            and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.rotate.definition"></a><h6>
+<a name="id605891"></a>
+            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.rotate.requirements"></a><h6>
+<a name="id605962"></a>
+            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
+<a name="id606024"></a>
+            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><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">middle</span><span class="special">)</span></code> is a valid range.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
+<a name="id606130"></a>
+            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> swaps are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="reverse_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="rotate_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,112 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>rotate_copy</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="rotate.html" title="rotate">
+<link rel="next" href="sort.html" title="sort">
+</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="rotate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="rotate_copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.rotate_copy"></a><a class="link" href="rotate_copy.html" title="rotate_copy">
+          rotate_copy</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a><h6>
+<a name="id606197"></a>
+            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">rotate_copy</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+    <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
+<a name="id606363"></a>
+            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">rotate_copy</span></code> rotates the
+            elements in a range. It copies the two ranges <code class="computeroutput"><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">middle</span><span class="special">)</span></code>
+            and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> to <code class="computeroutput"><span class="identifier">out</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.rotate_copy.definition"></a><h6>
+<a name="id606484"></a>
+            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a><h6>
+<a name="id606555"></a>
+            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
+<a name="id606641"></a>
+            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><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">middle</span><span class="special">)</span></code> is a valid range.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
+<a name="id606747"></a>
+            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> elements are copied.
+          </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="rotate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,153 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>sort</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="rotate_copy.html" title="rotate_copy">
+<link rel="next" href="stable_partition.html" title="stable_partition">
+</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="rotate_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="stable_partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="sort">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.sort"></a><a class="link" href="sort.html" title="sort"> sort</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.sort.prototype"></a><h6>
+<a name="id606813"></a>
+            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.sort.description"></a><h6>
+<a name="id607186"></a>
+            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">sort</span></code> sorts the elements
+            in <code class="computeroutput"><span class="identifier">rng</span></code> into ascending
+            order. <code class="computeroutput"><span class="identifier">sort</span></code> is not guaranteed
+            to be stable. Returns the sorted range.
+          </p>
+<p>
+            For versions of the <code class="computeroutput"><span class="identifier">sort</span></code>
+            function without a predicate, ascending order is defined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>
+            such that for all adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
+            <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+            <span class="identifier">x</span> <span class="special">==</span>
+            <span class="keyword">false</span></code>.
+          </p>
+<p>
+            For versions of the <code class="computeroutput"><span class="identifier">sort</span></code>
+            function with a predicate, ascending order is defined by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
+            <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.sort.definition"></a><h6>
+<a name="id607432"></a>
+            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.sort.requirements"></a><h6>
+<a name="id607503"></a>
+            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For versions of sort without a predicate:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For versions of sort with a predicate</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
+<a name="id607734"></a>
+            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code> comparisons (both average and worst-case),
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="rotate_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="stable_partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,135 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>stable_partition</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="sort.html" title="sort">
+<link rel="next" href="stable_sort.html" title="stable_sort">
+</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="sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="stable_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="stable_partition">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.stable_partition"></a><a class="link" href="stable_partition.html" title="stable_partition">
+          stable_partition</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.stable_partition.prototype"></a><h6>
+<a name="id607849"></a>
+            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">stable_partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+<span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+<span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">stable_partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
+<a name="id608413"></a>
+            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">stable_partition</span></code> reorders
+            the elements in the range <code class="computeroutput"><span class="identifier">rng</span></code>
+            base on the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
+            Once this function has completed all of the elements that satisfy <code class="computeroutput"><span class="identifier">pred</span></code> appear before all of the elements
+            that fail to satisfy it. <code class="computeroutput"><span class="identifier">stable_partition</span></code>
+            differs from <code class="computeroutput"><span class="identifier">partition</span></code>
+            because it preserves relative order. It is stable.
+          </p>
+<p>
+            For the versions that return an iterator, the return value is the iterator
+            to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<p>
+            For versions that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            the <code class="computeroutput"><span class="identifier">found</span></code> iterator is
+            the iterator to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.stable_partition.definition"></a><h6>
+<a name="id608558"></a>
+            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.stable_partition.requirements"></a><h6>
+<a name="id608632"></a>
+            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
+<a name="id608717"></a>
+            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
+          </h6>
+<p>
+            Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+            Worst case: <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
+            <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            swaps, where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="stable_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,157 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>stable_sort</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="stable_partition.html" title="stable_partition">
+<link rel="next" href="swap_ranges.html" title="swap_ranges">
+</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="stable_partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="swap_ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="stable_sort">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.stable_sort"></a><a class="link" href="stable_sort.html" title="stable_sort">
+          stable_sort</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.stable_sort.prototype"></a><h6>
+<a name="id608885"></a>
+            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.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">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
+<a name="id609257"></a>
+            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">stable_sort</span></code> sorts the
+            elements in <code class="computeroutput"><span class="identifier">rng</span></code> into
+            ascending order. <code class="computeroutput"><span class="identifier">stable_sort</span></code>
+            is guaranteed to be stable. The order is preserved for equivalent elements.
+          </p>
+<p>
+            For versions of the <code class="computeroutput"><span class="identifier">stable_sort</span></code>
+            function without a predicate ascending order is defined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>
+            such that for all adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
+            <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+            <span class="identifier">x</span> <span class="special">==</span>
+            <span class="keyword">false</span></code>.
+          </p>
+<p>
+            For versions of the <code class="computeroutput"><span class="identifier">stable_sort</span></code>
+            function with a predicate, ascending order is designed by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
+            <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.stable_sort.definition"></a><h6>
+<a name="id609501"></a>
+            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.stable_sort.requirements"></a><h6>
+<a name="id609572"></a>
+            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For versions of stable_sort without a predicate</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For versions of stable_sort with a predicate:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
+<a name="id609802"></a>
+            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
+          </h6>
+<p>
+            Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+            Worst case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)^</span><span class="number">2</span><span class="special">)</span></code>
+            comparisons, where <code class="computeroutput"><span class="identifier">N</span></code>
+            is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="stable_partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="swap_ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,104 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>swap_ranges</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="stable_sort.html" title="stable_sort">
+<link rel="next" href="transform.html" title="transform">
+</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="stable_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="transform.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="swap_ranges">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.swap_ranges"></a><a class="link" href="swap_ranges.html" title="swap_ranges">
+          swap_ranges</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a><h6>
+<a name="id609983"></a>
+            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.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">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
+<span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">swap_ranges</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
+<a name="id610114"></a>
+            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">swap_ranges</span></code> swaps each
+            element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng1</span></code> with the corresponding element
+            <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng2</span></code>.
+            Returns a reference to <code class="computeroutput"><span class="identifier">rng2</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.swap_ranges.definition"></a><h6>
+<a name="id610203"></a>
+            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">swap_ranges</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a><h6>
+<a name="id610274"></a>
+            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              mutable.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
+<a name="id610374"></a>
+            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> elements are swapped.
+          </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="stable_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="transform.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,225 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>transform</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="swap_ranges.html" title="swap_ranges">
+<link rel="next" href="unique.html" title="unique">
+</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="swap_ranges.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="unique.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="transform">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.transform"></a><a class="link" href="transform.html" title="transform"> transform</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.transform.prototype"></a><h6>
+<a name="id610442"></a>
+            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryOperation</span>
+<span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">transform</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+                         <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
+                         <span class="identifier">UnaryOperation</span> <span class="identifier">fun</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryOperation</span>
+<span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">transform</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
+                         <span class="identifier">BinaryOperation</span> <span class="identifier">fun</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.transform.description"></a><h6>
+<a name="id610772"></a>
+            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
+          </h6>
+<p>
+            <span class="bold"><strong>UnaryOperation version:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">transform</span></code> assigns the
+            value <code class="computeroutput"><span class="identifier">y</span></code> to each element
+            <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)),</span> <span class="identifier">y</span> <span class="special">=</span> <span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">x</span></code>
+            is the corresponding value to <code class="computeroutput"><span class="identifier">y</span></code>
+            in <code class="computeroutput"><span class="identifier">rng1</span></code>. The return value
+            is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span>
+            <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>BinaryOperation version:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">transform</span></code> assigns the
+            value <code class="computeroutput"><span class="identifier">z</span></code> to each element
+            <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))),</span> <span class="identifier">z</span> <span class="special">=</span> <span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">x</span></code>
+            is the corresponding value in <code class="computeroutput"><span class="identifier">rng1</span></code>
+            and <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
+            value in <code class="computeroutput"><span class="identifier">rng2</span></code>. This version
+            of <code class="computeroutput"><span class="identifier">transform</span></code> stops upon
+            reaching either the end of <code class="computeroutput"><span class="identifier">rng1</span></code>,
+            or the end of <code class="computeroutput"><span class="identifier">rng2</span></code>. Hence
+            there isn't a requirement for <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>
+            since there is a safe guaranteed behaviour, unlike with the iterator
+            counterpart in the standard library.
+          </p>
+<p>
+            The return value is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
+          </p>
+<a name="range.reference.algorithms.mutating.transform.definition"></a><h6>
+<a name="id611306"></a>
+            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transform</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.transform.requirements"></a><h6>
+<a name="id611377"></a>
+            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the unary versions of transform:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryOperation</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type must be convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
+              argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s result
+              type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the binary versions of transform:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+              second argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s result
+              type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
+<a name="id611991"></a>
+            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the unary version of transform:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
+              within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code> is a valid range.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the binary version of transform:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
+              within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
+              within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)))</span></code> is a valid range.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
+<a name="id612395"></a>
+            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. The operation is applied exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> for the unary version and <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+            for the binary version.
+          </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="swap_ranges.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="unique.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,163 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>unique</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="transform.html" title="transform">
+<link rel="next" href="unique_copy.html" title="unique_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="transform.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="unique_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="unique">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.unique"></a><a class="link" href="unique.html" title="unique"> unique</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.unique.prototype"></a><h6>
+<a name="id612512"></a>
+            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.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">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.unique.description"></a><h6>
+<a name="id613514"></a>
+            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">unique</span></code> removes all but
+            the first element of each sequence of duplicate encountered in <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<p>
+            Elements in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span>
+            <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
+            are dereferenceable but undefined.
+          </p>
+<p>
+            Equality is determined by the predicate if one is supplied, or by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>
+            for <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+            type.
+          </p>
+<a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
+<a name="id613634"></a>
+            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.unique.requirements"></a><h6>
+<a name="id613704"></a>
+            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions of unique:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
+<a name="id613909"></a>
+            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+            Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            comparisons are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="transform.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="unique_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,143 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>unique_copy</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../mutating.html" title="Mutating algorithms">
+<link rel="prev" href="unique.html" title="unique">
+<link rel="next" href="../non_mutating.html" title="Non-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="unique.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="../non_mutating.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="unique_copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.mutating.unique_copy"></a><a class="link" href="unique_copy.html" title="unique_copy">
+          unique_copy</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.mutating.unique_copy.prototype"></a><h6>
+<a name="id614033"></a>
+            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
+<a name="id614285"></a>
+            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">unique_copy</span></code> copies the
+            first element of each sequence of duplicates encountered in <code class="computeroutput"><span class="identifier">rng</span></code> to <code class="computeroutput"><span class="identifier">out</span></code>.
+          </p>
+<p>
+            Equality is determined by the predicate if one is supplied, or by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>
+            for <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+            value type.
+          </p>
+<a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
+<a name="id614373"></a>
+            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.mutating.unique_copy.requirements"></a><h6>
+<a name="id614444"></a>
+            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions of unique:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
+<a name="id614701"></a>
+            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+            Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            comparisons are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="unique.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.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="../non_mutating.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,57 @@
+<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.2">
+<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/prev_permutation.html" title="prev_permutation">
+<link rel="next" href="new/copy_n.html" title="copy_n">
+</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/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="new/copy_n.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.new"></a><a class="link" href="new.html" title="New algorithms"> New algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> copy_n</span></dt>
+<dt><span class="section"> erase</span></dt>
+<dt><span class="section"> for_each</span></dt>
+<dt><span class="section"> insert</span></dt>
+<dt><span class="section"> iota</span></dt>
+<dt><span class="section"> is_sorted</span></dt>
+<dt><span class="section"> overwrite</span></dt>
+<dt><span class="section"> push_back</span></dt>
+<dt><span class="section"> push_front</span></dt>
+<dt><span class="section"> remove_erase</span></dt>
+<dt><span class="section"><a href="new/remove_erase_if.html">
+          remove_erase_if</a></span></dt>
+</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/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="new/copy_n.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,103 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>copy_n</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="../new.html" title="New algorithms">
+<link rel="next" href="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="../new.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="copy_n">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n"> copy_n</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.copy_n.prototype"></a><h6>
+<a name="id648347"></a>
+            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.copy_n.description"></a><h6>
+<a name="id648503"></a>
+            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">copy_n</span></code> is provided to
+            completely replicate the standard algorithm header, it is preferable
+            to use Range Adaptors and the extension functions to achieve the same
+            result with greater safety.
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">copy_n</span></code> copies elements
+            from <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code> to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>
+          </p>
+<a name="range.reference.algorithms.new.copy_n.definition"></a><h6>
+<a name="id648673"></a>
+            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.copy_n.requirements"></a><h6>
+<a name="id648744"></a>
+            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Size</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
+<a name="id648846"></a>
+            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> elements
+            are copied.
+          </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="../new.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,96 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>erase</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="copy_n.html" title="copy_n">
+<link rel="next" href="for_each.html" title="for_each">
+</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="copy_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="erase">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase"> erase</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.erase.prototype"></a><h6>
+<a name="id648901"></a>
+            <a class="link" href="erase.html#range.reference.algorithms.new.erase.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">Container</span><span class="special">&gt;</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">erase</span><span class="special">(</span>
+    <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">to_erase</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.erase.description"></a><h6>
+<a name="id649040"></a>
+            <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">erase</span></code> the iterator range
+            <code class="computeroutput"><span class="identifier">to_erase</span></code> from the container
+            <code class="computeroutput"><span class="identifier">target</span></code>.
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_erase</span></code> performs
+            the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">value</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> performs
+            the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">pred</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
+          </p>
+<a name="range.reference.algorithms.new.erase.definition"></a><h6>
+<a name="id649337"></a>
+            <a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.erase.requirements"></a><h6>
+<a name="id649407"></a>
+            <a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<code class="computeroutput"><span class="identifier">Container</span></code> supports
+              erase of an iterator range.
+            </li></ol></div>
+<a name="range.reference.algorithms.new.erase.complexity"></a><h6>
+<a name="id649452"></a>
+            <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Proprotional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">to_erase</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="copy_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,149 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>for_each</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="erase.html" title="erase">
+<link rel="next" href="insert.html" title="insert">
+</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="erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="insert.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="for_each">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each"> for_each</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.for_each.prototype"></a><h6>
+<a name="id649517"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
+    <span class="special">&gt;</span>
+<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                        <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                        <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
+    <span class="special">&gt;</span>
+<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                        <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                        <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
+    <span class="special">&gt;</span>
+<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                        <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                        <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
+    <span class="special">&gt;</span>
+<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                        <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                        <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.for_each.description"></a><h6>
+<a name="id650085"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
+            through <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> simultaneously. For each iteration,
+            the element <code class="computeroutput"><span class="identifier">x</span></code> is used
+            from <code class="computeroutput"><span class="identifier">rng1</span></code> and the corresponding
+            element <code class="computeroutput"><span class="identifier">y</span></code> is used from
+            <code class="computeroutput"><span class="identifier">rng2</span></code> to invoke <code class="computeroutput"><span class="identifier">fn</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>.
+          </p>
+<p>
+            Iteration is stopped upon reaching the end of the shorter of <code class="computeroutput"><span class="identifier">rng1</span></code>, or <code class="computeroutput"><span class="identifier">rng2</span></code>.
+            It is safe to call this function with unequal length ranges.
+          </p>
+<a name="range.reference.algorithms.new.for_each.definition"></a><h6>
+<a name="id650243"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.for_each.requirements"></a><h6>
+<a name="id650315"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryFunction</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglepassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+              second argument type.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
+<a name="id650466"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+            applications of <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="insert.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,105 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>insert</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="for_each.html" title="for_each">
+<link rel="next" href="iota.html" title="iota">
+</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="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="insert">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert"> insert</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.insert.prototype"></a><h6>
+<a name="id650572"></a>
+            <a class="link" href="insert.html#range.reference.algorithms.new.insert.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">Container</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
+    <span class="special">&gt;</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                  <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">before</span><span class="special">,</span>
+                  <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.insert.description"></a><h6>
+<a name="id650738"></a>
+            <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">insert</span></code> all of the elements
+            in the range <code class="computeroutput"><span class="identifier">from</span></code> before
+            the <code class="computeroutput"><span class="identifier">before</span></code> iterator into
+            <code class="computeroutput"><span class="identifier">target</span></code>.
+          </p>
+<a name="range.reference.algorithms.new.insert.definition"></a><h6>
+<a name="id650807"></a>
+            <a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.insert.requirements"></a><h6>
+<a name="id650878"></a>
+            <a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Container</span></code> supports
+              insert at a specified position.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
+              value type.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.insert.complexity"></a><h6>
+<a name="id650969"></a>
+            <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
+            assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,95 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>iota</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="insert.html" title="insert">
+<link rel="next" href="is_sorted.html" title="is_sorted">
+</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="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="is_sorted.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="iota">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota"> iota</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.iota.prototype"></a><h6>
+<a name="id651038"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.new.iota.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.iota.description"></a><h6>
+<a name="id651162"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">iota</span></code> traverses forward
+            through <code class="computeroutput"><span class="identifier">rng</span></code>, each element
+            <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code>
+            is assigned a value equivalent to <code class="computeroutput"><span class="identifier">x</span>
+            <span class="special">+</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">it</span><span class="special">)</span></code>
+          </p>
+<a name="range.reference.algorithms.new.iota.definition"></a><h6>
+<a name="id651298"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.iota.requirements"></a><h6>
+<a name="id651367"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">Incrementable</span></code> Concept.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.iota.complexity"></a><h6>
+<a name="id651443"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments into <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="is_sorted.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,108 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>is_sorted</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="iota.html" title="iota">
+<link rel="next" href="overwrite.html" title="overwrite">
+</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="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="is_sorted">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted"> is_sorted</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.is_sorted.prototype"></a><h6>
+<a name="id651519"></a>
+            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.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">SinglePassRange</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
+<a name="id651710"></a>
+            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">is_sorted</span></code> determines
+            if a range is sorted. For the non-predicate version the return value
+            is <code class="computeroutput"><span class="keyword">true</span></code> if and only if for
+            each adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
+            the expression <code class="computeroutput"><span class="identifier">x</span> <span class="special">&lt;</span>
+            <span class="identifier">y</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
+            For the predicate version the return value is <code class="computeroutput"><span class="keyword">true</span></code>
+            is and only if for each adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
+            the expression <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>.
+          </p>
+<a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
+<a name="id651900"></a>
+            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.is_sorted.requirements"></a><h6>
+<a name="id651972"></a>
+            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
+              Concept.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to both argument types of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
+<a name="id652075"></a>
+            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. A maximum of <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,110 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>overwrite</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="is_sorted.html" title="is_sorted">
+<link rel="next" href="push_back.html" title="push_back">
+</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="is_sorted.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="overwrite">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite"> overwrite</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.overwrite.prototype"></a><h6>
+<a name="id652142"></a>
+            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span>
+    <span class="special">&gt;</span>
+<span class="keyword">void</span> <span class="identifier">overwrite</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">,</span>
+               <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">to</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.overwrite.description"></a><h6>
+<a name="id652276"></a>
+            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">overwrite</span></code> assigns the
+            values from the range <code class="computeroutput"><span class="identifier">from</span></code>
+            into the range <code class="computeroutput"><span class="identifier">to</span></code>.
+          </p>
+<a name="range.reference.algorithms.new.overwrite.definition"></a><h6>
+<a name="id652334"></a>
+            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.overwrite.requirements"></a><h6>
+<a name="id652405"></a>
+            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              mutable.
+            </li>
+<li class="listitem"><code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">)</span>
+              <span class="special">&lt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange2</span><span class="special">)</span></code></li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
+<a name="id652572"></a>
+            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
+            assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="is_sorted.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,103 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>push_back</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="overwrite.html" title="overwrite">
+<link rel="next" href="push_front.html" title="push_front">
+</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="overwrite.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="push_front.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="push_back">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back"> push_back</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.push_back.prototype"></a><h6>
+<a name="id652640"></a>
+            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.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">Container</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
+    <span class="special">&gt;</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                     <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.push_back.description"></a><h6>
+<a name="id652778"></a>
+            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">push_back</span></code> all of the
+            elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
+            to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
+          </p>
+<a name="range.reference.algorithms.new.push_back.definition"></a><h6>
+<a name="id652836"></a>
+            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.push_back.requirements"></a><h6>
+<a name="id652906"></a>
+            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Container</span></code> supports
+              insert at <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
+              value type.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
+<a name="id653013"></a>
+            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
+            assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="overwrite.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="push_front.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,103 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>push_front</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="push_back.html" title="push_back">
+<link rel="next" href="remove_erase.html" title="remove_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="push_back.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="remove_erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="push_front">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front"> push_front</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.push_front.prototype"></a><h6>
+<a name="id653081"></a>
+            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.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">Container</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
+    <span class="special">&gt;</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">push_front</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                      <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.push_front.description"></a><h6>
+<a name="id653218"></a>
+            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">push_front</span></code> all of the
+            elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
+            to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
+          </p>
+<a name="range.reference.algorithms.new.push_front.definition"></a><h6>
+<a name="id653275"></a>
+            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.push_front.requirements"></a><h6>
+<a name="id653346"></a>
+            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Container</span></code> supports
+              insert at <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
+              value type.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
+<a name="id653453"></a>
+            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
+            assignments are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="push_back.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="remove_erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,88 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>remove_erase</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="push_front.html" title="push_front">
+<link rel="next" href="remove_erase_if.html" title="remove_erase_if">
+</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="push_front.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="remove_erase_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="remove_erase">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase"> remove_erase</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.remove_erase.prototype"></a><h6>
+<a name="id653521"></a>
+            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.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">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                        <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
+<a name="id653657"></a>
+            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
+            eliminates the elements equal to <code class="computeroutput"><span class="identifier">value</span></code>
+            from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">remove</span></code>
+            algorithm which merely rearranges elements.
+          </p>
+<a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
+<a name="id653717"></a>
+            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.remove_erase.requirements"></a><h6>
+<a name="id653788"></a>
+            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<code class="computeroutput"><span class="identifier">Container</span></code> supports
+              erase of an iterator range.
+            </li></ol></div>
+<a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
+<a name="id653831"></a>
+            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
+          </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="push_front.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="remove_erase_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,96 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>remove_erase_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../new.html" title="New algorithms">
+<link rel="prev" href="remove_erase.html" title="remove_erase">
+<link rel="next" href="../numeric.html" title="Numeric 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="remove_erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="../numeric.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="remove_erase_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">
+          remove_erase_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
+<a name="id653900"></a>
+            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.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">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">&gt;</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                           <span class="identifier">Pred</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
+<a name="id654025"></a>
+            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> removes
+            the elements <code class="computeroutput"><span class="identifier">x</span></code> that satisfy
+            <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+            from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">erase</span></code>
+            algorithm which merely rearranges elements.
+          </p>
+<a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
+<a name="id654107"></a>
+            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.new.remove_erase_if.requirements"></a><h6>
+<a name="id654178"></a>
+            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Container</span></code> supports
+              erase of an iterator range.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Pred</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">Predicate</span></code> Concept.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
+<a name="id654248"></a>
+            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
+          </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="remove_erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.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="../numeric.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,81 @@
+<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.2">
+<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="mutating/unique_copy.html" title="unique_copy">
+<link rel="next" href="non_mutating/adjacent_find.html" title="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="mutating/unique_copy.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="non_mutating/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.non_mutating"></a><a class="link" href="non_mutating.html" title="Non-mutating algorithms"> Non-mutating
+        algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="non_mutating/adjacent_find.html">
+          adjacent_find</a></span></dt>
+<dt><span class="section"><a href="non_mutating/binary_search.html">
+          binary_search</a></span></dt>
+<dt><span class="section"> count</span></dt>
+<dt><span class="section"><a href="non_mutating/count_if.html">
+          count_if</a></span></dt>
+<dt><span class="section"> equal</span></dt>
+<dt><span class="section"><a href="non_mutating/equal_range.html">
+          equal_range</a></span></dt>
+<dt><span class="section"><a href="non_mutating/for_each.html">
+          for_each</a></span></dt>
+<dt><span class="section"> find</span></dt>
+<dt><span class="section"><a href="non_mutating/find_end.html">
+          find_end</a></span></dt>
+<dt><span class="section"><a href="non_mutating/find_first_of.html">
+          find_first_of</a></span></dt>
+<dt><span class="section"><a href="non_mutating/find_if.html">
+          find_if</a></span></dt>
+<dt><span class="section"><a href="non_mutating/lexicographical_compare.html">
+          lexicographical_compare</a></span></dt>
+<dt><span class="section"><a href="non_mutating/lower_bound.html">
+          lower_bound</a></span></dt>
+<dt><span class="section"><a href="non_mutating/max_element.html">
+          max_element</a></span></dt>
+<dt><span class="section"><a href="non_mutating/min_element.html">
+          min_element</a></span></dt>
+<dt><span class="section"><a href="non_mutating/mismatch.html">
+          mismatch</a></span></dt>
+<dt><span class="section"><a href="non_mutating/search.html">
+          search</a></span></dt>
+<dt><span class="section"><a href="non_mutating/search_n.html">
+          search_n</a></span></dt>
+<dt><span class="section"><a href="non_mutating/upper_bound.html">
+          upper_bound</a></span></dt>
+</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="mutating/unique_copy.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="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,168 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>adjacent_find</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="next" href="binary_search.html" title="binary_search">
+</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="../non_mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="binary_search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="adjacent_find">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">
+          adjacent_find</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
+<a name="id614844"></a>
+            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.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">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value_re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value_re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
+<a name="id615801"></a>
+            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
+          </h6>
+<p>
+            <span class="bold"><strong>Non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">adjacent_find</span></code> finds the
+            first adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
+            in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">y</span></code>
+          </p>
+<p>
+            <span class="bold"><strong>Predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">adjacent_find</span></code> finds the
+            first adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
+            in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a><h6>
+<a name="id616008"></a>
+            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a><h6>
+<a name="id616080"></a>
+            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions of adjacent_find:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions of adjacent_find:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
+<a name="id616258"></a>
+            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            then no comparisons are performed; otherwise, at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            comparisons.
+          </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="../non_mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="binary_search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,157 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>binary_search</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="adjacent_find.html" title="adjacent_find">
+<link rel="next" href="count.html" title="count">
+</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="adjacent_find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="count.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="binary_search">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">
+          binary_search</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
+<a name="id616361"></a>
+            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
+<a name="id616634"></a>
+            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">binary_search</span></code> returns
+            <code class="computeroutput"><span class="keyword">true</span></code> if and only if the
+            value <code class="computeroutput"><span class="identifier">val</span></code> exists in the
+            range <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.binary_search.definition"></a><h6>
+<a name="id616704"></a>
+            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a><h6>
+<a name="id616776"></a>
+            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions of binary_search:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions of binary_search:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
+<a name="id617026"></a>
+            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate version:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
+            order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate version:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
+            order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a><h6>
+<a name="id617120"></a>
+            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
+          </h6>
+<p>
+            For non-random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">N</span></code>
+            is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+<p>
+            For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="adjacent_find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="count.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,107 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>count</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="binary_search.html" title="binary_search">
+<link rel="next" href="count_if.html" title="count_if">
+</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="binary_search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="count_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="count">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count"> count</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.count.prototype"></a><h6>
+<a name="id617285"></a>
+            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">count</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
+<a name="id617574"></a>
+            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">count</span></code> returns the number
+            of elements <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">x</span>
+            <span class="special">==</span> <span class="identifier">val</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
+<a name="id617662"></a>
+            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.count.requirements"></a><h6>
+<a name="id617733"></a>
+            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              An object of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+              value type can be compared for equality with an object of type <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
+<a name="id617856"></a>
+            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons.
+          </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="binary_search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="count_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,104 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>count_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="count.html" title="count">
+<link rel="next" href="equal.html" title="equal">
+</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="count.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="equal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="count_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">
+          count_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
+<a name="id617925"></a>
+            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">count_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
+<a name="id618080"></a>
+            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">count_if</span></code> returns the
+            number of elements <code class="computeroutput"><span class="identifier">x</span></code>
+            in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.count_if.definition"></a><h6>
+<a name="id618171"></a>
+            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.count_if.requirements"></a><h6>
+<a name="id618242"></a>
+            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
+<a name="id618365"></a>
+            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="count.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="equal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,162 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>equal</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="count_if.html" title="count_if">
+<link rel="next" href="equal_range.html" title="equal_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="count_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="equal_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="equal">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal"> equal</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.equal.prototype"></a><h6>
+<a name="id618442"></a>
+            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span>
+<span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+           <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+<span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+           <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+           <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
+<a name="id618721"></a>
+            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">equal</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is equal to the <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> and for each element <code class="computeroutput"><span class="identifier">x</span></code>
+            in <code class="computeroutput"><span class="identifier">rng1</span></code>, the corresponding
+            element <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng2</span></code> is equal. Otherwise <code class="computeroutput"><span class="keyword">false</span></code> is returned.
+          </p>
+<p>
+            In this range version of <code class="computeroutput"><span class="identifier">equal</span></code>
+            it is perfectly acceptable to pass in two ranges of unequal lengths.
+          </p>
+<p>
+            Elements are considered equal in the non-predicate version if <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
+            returns <code class="computeroutput"><span class="keyword">true</span></code>. Elements are
+            considered equal in the predicate version if <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal.definition"></a><h6>
+<a name="id618957"></a>
+            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal.requirements"></a><h6>
+<a name="id619028"></a>
+            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
+<a name="id619318"></a>
+            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+            comparisons.
+          </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="count_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="equal_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,179 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>equal_range</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="equal.html" title="equal">
+<link rel="next" href="for_each.html" title="for_each">
+</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="equal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="equal_range">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">
+          equal_range</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
+<a name="id619413"></a>
+            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.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">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+          <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+          <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+          <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+          <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>                      
+ </pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
+<a name="id620265"></a>
+            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">equal_range</span></code> returns a
+            range in the form of a pair of iterators where all of the elements are
+            equal to <code class="computeroutput"><span class="identifier">val</span></code>. If no values
+            are found that are equal to <code class="computeroutput"><span class="identifier">val</span></code>,
+            then an empty range is returned, hence <code class="computeroutput"><span class="identifier">result</span><span class="special">.</span><span class="identifier">first</span> <span class="special">==</span> <span class="identifier">result</span><span class="special">.</span><span class="identifier">second</span></code>.
+            For the non-predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code>
+            the equality of elements is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>. For the predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code> the equality of elements
+            is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal_range.definition"></a><h6>
+<a name="id620412"></a>
+            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a><h6>
+<a name="id620485"></a>
+            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SortPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to both of <code class="computeroutput"><span class="identifier">SortPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
+<a name="id620733"></a>
+            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
+          </h6>
+<p>
+            For the non-predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
+            is ordered in ascending order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            For the predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
+            is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a><h6>
+<a name="id620809"></a>
+            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
+          </h6>
+<p>
+            For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
+            otherwise the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="equal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,110 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>find</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="for_each.html" title="for_each">
+<link rel="next" href="find_end.html" title="find_end">
+</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="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_end.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="find">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find"> find</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.find.prototype"></a><h6>
+<a name="id621468"></a>
+            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
+<a name="id621753"></a>
+            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">find</span></code>
+            that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span> <span class="special">==</span> <span class="identifier">value</span></code>. <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> is returned if no such iterator exists.
+            The versions of find that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
+<a name="id621872"></a>
+            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find.requirements"></a><h6>
+<a name="id621942"></a>
+            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
+              is defined for type <code class="computeroutput"><span class="identifier">Value</span></code>
+              to be compared with the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
+<a name="id622056"></a>
+            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons for equality.
+          </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="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_end.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,174 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>find_end</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="find.html" title="find">
+<link rel="next" href="find_first_of.html" title="find_first_of">
+</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="find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_first_of.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="find_end">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">
+          find_end</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
+<a name="id622124"></a>
+            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.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">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
+<a name="id622769"></a>
+            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
+            that return an iterator, return an iterator to the beginning of the last
+            sub-sequence equal to <code class="computeroutput"><span class="identifier">rng2</span></code>
+            within <code class="computeroutput"><span class="identifier">rng1</span></code>. Equality
+            is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">find_end</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions. The
+            versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
+<a name="id622898"></a>
+            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_end.requirements"></a><h6>
+<a name="id622970"></a>
+            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              Objects of <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s
+              value type can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value type.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
+<a name="id623256"></a>
+            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
+          </h6>
+<p>
+            The number of comparisons is proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. If both <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>
+            and <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> are
+            models of <code class="computeroutput"><span class="identifier">BidirectionalRangeConcept</span></code>
+            then the average complexity is linear and the worst case is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+</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="find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_first_of.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,170 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>find_first_of</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="find_end.html" title="find_end">
+<link rel="next" href="find_if.html" title="find_if">
+</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="find_end.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="find_first_of">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">
+          find_first_of</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
+<a name="id623429"></a>
+            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.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">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
+<a name="id624079"></a>
+            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
+            that return an iterator, return an iterator to the first occurrence in
+            <code class="computeroutput"><span class="identifier">rng1</span></code> of any of the elements
+            in <code class="computeroutput"><span class="identifier">rng2</span></code>. Equality is
+            determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
+            for non-predicate versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>,
+            and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code>
+            in the predicate versions.
+          </p>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
+<a name="id624214"></a>
+            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a><h6>
+<a name="id624287"></a>
+            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
+              and can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
+<a name="id624537"></a>
+            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
+          </h6>
+<p>
+            At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> comparisons.
+          </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="find_end.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,121 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>find_if</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="find_first_of.html" title="find_first_of">
+<link rel="next" href="lexicographical_compare.html" title="lexicographical_compare">
+</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="find_first_of.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="find_if">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">
+          find_if</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
+<a name="id624629"></a>
+            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
+<a name="id624914"></a>
+            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
+            that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that <code class="computeroutput"><span class="identifier">pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
+            <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            is returned if no such iterator exists.
+          </p>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines found in the same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_if.definition"></a><h6>
+<a name="id625046"></a>
+            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_if.requirements"></a><h6>
+<a name="id625117"></a>
+            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
+<a name="id625216"></a>
+            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
+          </h6>
+<p>
+            For each iterator <code class="computeroutput"><span class="identifier">i</span></code> in
+            <code class="computeroutput"><span class="identifier">rng</span></code>, <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span></code> is in the domain of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.find_if.complexity"></a><h6>
+<a name="id625287"></a>
+            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="find_first_of.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,113 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>for_each</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="equal_range.html" title="equal_range">
+<link rel="next" href="find.html" title="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="equal_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="for_each">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.for_each"></a><a class="link" href="for_each.html" title="for_each">
+          for_each</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.for_each.prototype"></a><h6>
+<a name="id620907"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.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">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
+    <span class="special">&gt;</span>
+<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
+    <span class="special">&gt;</span>
+<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>    
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
+<a name="id621128"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
+            through <code class="computeroutput"><span class="identifier">rng</span></code> and for each
+            element <code class="computeroutput"><span class="identifier">x</span></code> it invokes
+            <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.for_each.definition"></a><h6>
+<a name="id621208"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.for_each.requirements"></a><h6>
+<a name="id621278"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryFunction</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">UnaryFunction</span></code> does
+              not apply any non-constant operation through its argument.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
+              argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
+<a name="id621391"></a>
+            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="equal_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,170 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>lexicographical_compare</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="find_if.html" title="find_if">
+<link rel="next" href="lower_bound.html" title="lower_bound">
+</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="find_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="lower_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="lexicographical_compare">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">
+          lexicographical_compare</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
+<a name="id625368"></a>
+            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span>
+    <span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                             <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                             <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                             <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>    
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
+<a name="id625649"></a>
+            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
+            compares element by element <code class="computeroutput"><span class="identifier">rng1</span></code>
+            against <code class="computeroutput"><span class="identifier">rng2</span></code>. If the
+            element from <code class="computeroutput"><span class="identifier">rng1</span></code> is
+            less than the element from <code class="computeroutput"><span class="identifier">rng2</span></code>
+            then <code class="computeroutput"><span class="keyword">true</span></code> is returned. If
+            the end of <code class="computeroutput"><span class="identifier">rng1</span></code> without
+            reaching the end of <code class="computeroutput"><span class="identifier">rng2</span></code>
+            this also causes the return value to be <code class="computeroutput"><span class="keyword">true</span></code>.
+            The return value is <code class="computeroutput"><span class="keyword">false</span></code>
+            in all other circumstances. The elements are compared using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>
+            in the non-predicate versions of <code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
+            and using <code class="computeroutput"><span class="identifier">pred</span></code> in the
+            predicate versions.
+          </p>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
+<a name="id625822"></a>
+            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a><h6>
+<a name="id625894"></a>
+            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions of lexicographical_compare:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              Let <code class="computeroutput"><span class="identifier">x</span></code> be an object
+              of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type. Let <code class="computeroutput"><span class="identifier">y</span></code> be
+              an obect of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type. <code class="computeroutput"><span class="identifier">x</span> <span class="special">&lt;</span>
+              <span class="identifier">y</span></code> must be valid. <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+              <span class="identifier">x</span></code> must be valid.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions of lexicographical_compare:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
+<a name="id626250"></a>
+            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
+            <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
+            comparisons.
+          </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="find_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="lower_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,176 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>lower_bound</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="lexicographical_compare.html" title="lexicographical_compare">
+<link rel="next" href="max_element.html" title="max_element">
+</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="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="max_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="lower_bound">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">
+          lower_bound</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
+<a name="id626355"></a>
+            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
+<a name="id626640"></a>
+            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
+            that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that: without predicate -
+            <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span>
+            <span class="special">&lt;</span> <span class="identifier">value</span></code>
+            is <code class="computeroutput"><span class="keyword">false</span></code>, with predicate
+            - <code class="computeroutput"><span class="identifier">pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">value</span><span class="special">)</span></code>
+            is <code class="computeroutput"><span class="keyword">false</span></code>.
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            is returned if no such iterator exists.
+          </p>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
+<a name="id626831"></a>
+            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a><h6>
+<a name="id626904"></a>
+            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
+<a name="id627153"></a>
+            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
+            order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
+            order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a><h6>
+<a name="id627246"></a>
+            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
+          </h6>
+<p>
+            For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+            Access Range</a> concept the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+<p>
+            For all other range types the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="max_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,166 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>max_element</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="lower_bound.html" title="lower_bound">
+<link rel="next" href="min_element.html" title="min_element">
+</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="lower_bound.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="min_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="max_element">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">
+          max_element</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
+<a name="id627390"></a>
+            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.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">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value_re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
+<a name="id628354"></a>
+            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
+            that return an iterator, return the iterator to the maximum value as
+            determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> if a predicate is not supplied. Otherwise
+            the predicate <code class="computeroutput"><span class="identifier">pred</span></code> is
+            used to determine the maximum value. The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
+<a name="id628453"></a>
+            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.max_element.requirements"></a><h6>
+<a name="id628525"></a>
+            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
+<a name="id628690"></a>
+            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            comparisons.
+          </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="lower_bound.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="min_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,166 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>min_element</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="max_element.html" title="max_element">
+<link rel="next" href="mismatch.html" title="mismatch">
+</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="max_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="mismatch.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="min_element">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">
+          min_element</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
+<a name="id628792"></a>
+            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.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">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value_re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
+<a name="id630027"></a>
+            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
+            that return an iterator, return the iterator to the minimum value as
+            determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> if a predicate is not supplied. Otherwise
+            the predicate <code class="computeroutput"><span class="identifier">pred</span></code> is
+            used to determine the minimum value. The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
+<a name="id630125"></a>
+            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.min_element.requirements"></a><h6>
+<a name="id630198"></a>
+            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
+<a name="id630364"></a>
+            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            comparisons.
+          </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="max_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="mismatch.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,216 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>mismatch</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="min_element.html" title="min_element">
+<link rel="next" href="search.html" title="search">
+</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="min_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="mismatch">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">
+          mismatch</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
+<a name="id630466"></a>
+            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.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">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+         <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+         <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+         <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+         <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
+<a name="id632143"></a>
+            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
+            position where the correseponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
+            are not equal.
+          </p>
+<p>
+            Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
+          </p>
+<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
+<a name="id632241"></a>
+            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a><h6>
+<a name="id632312"></a>
+            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>s value
+              type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
+<a name="id632603"></a>
+            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a><h6>
+<a name="id632676"></a>
+            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> comparisons.
+          </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="min_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,206 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>search</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="mismatch.html" title="mismatch">
+<link rel="next" href="search_n.html" title="search_n">
+</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="mismatch.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="search_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="search">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">
+          search</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
+<a name="id632744"></a>
+            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.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">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
+<a name="id634051"></a>
+            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">search</span></code>
+            that return an iterator, return an iterator to the start of the first
+            subsequence in <code class="computeroutput"><span class="identifier">rng1</span></code> that
+            is equal to the subsequence <code class="computeroutput"><span class="identifier">rng2</span></code>.
+            The <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
+            is returned if no such subsequence exists in <code class="computeroutput"><span class="identifier">rng1</span></code>.
+            Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">search</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
+          </p>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">search</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
+<a name="id634218"></a>
+            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.search.requirements"></a><h6>
+<a name="id634289"></a>
+            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>s value
+              type can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
+              value type.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
+              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
+<a name="id634574"></a>
+            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
+          </h6>
+<p>
+            Average complexity is Linear. Worst-case complexity is quadratic.
+          </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="mismatch.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="search_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,148 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>search_n</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="search.html" title="search">
+<link rel="next" href="upper_bound.html" title="upper_bound">
+</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="search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="upper_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="search_n">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">
+          search_n</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
+<a name="id634619"></a>
+            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search_n</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search_n</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span>
+         <span class="identifier">BinaryPredicate</span> <span class="identifier">binary_pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">search_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span>
+         <span class="identifier">BinaryPredicate</span> <span class="identifier">binary_pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
+<a name="id635352"></a>
+            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">search_n</span></code> searches <code class="computeroutput"><span class="identifier">rng</span></code> for a sequence of length <code class="computeroutput"><span class="identifier">n</span></code> equal to <code class="computeroutput"><span class="identifier">value</span></code>
+            where equality is determined by operator== in the non-predicate case,
+            and by a predicate when one is supplied.
+          </p>
+<a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
+<a name="id635420"></a>
+            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.search_n.requirements"></a><h6>
+<a name="id635492"></a>
+            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>s value
+              type can be compared for equality with <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
+<a name="id635757"></a>
+            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
+          </h6>
+<p>
+            Average complexity is Linear. Worst-case complexity is quadratic.
+          </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="search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="upper_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,173 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>upper_bound</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
+<link rel="prev" href="search_n.html" title="search_n">
+<link rel="next" href="../set.html" title="Set 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="search_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="upper_bound">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">
+          upper_bound</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
+<a name="id635803"></a>
+            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.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">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
+<a name="id636087"></a>
+            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
+          </h6>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
+            that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that: without predicate -
+            <code class="computeroutput"><span class="identifier">val</span> <span class="special">&lt;</span>
+            <span class="special">*</span><span class="identifier">i</span></code>
+            is <code class="computeroutput"><span class="keyword">true</span></code>, with predicate
+            - <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">val</span><span class="special">,</span> <span class="special">*</span><span class="identifier">i</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            is returned if no such iterator exists.
+          </p>
+<p>
+            The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
+            that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
+            defines <code class="computeroutput"><span class="identifier">found</span></code> in the
+            same manner as the returned iterator described above.
+          </p>
+<a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
+<a name="id636283"></a>
+            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a><h6>
+<a name="id636356"></a>
+            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
+<a name="id636606"></a>
+            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
+            order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
+            order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a><h6>
+<a name="id636698"></a>
+            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
+          </h6>
+<p>
+            For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+            Access Range</a> Concept the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+            For all other range types the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="search_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,52 @@
+<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.2">
+<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="new/remove_erase_if.html" title="remove_erase_if">
+<link rel="next" href="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="new/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="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.numeric"></a><a class="link" href="numeric.html" title="Numeric algorithms"> Numeric algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> accumulate</span></dt>
+<dt><span class="section"><a href="numeric/adjacent_difference.html">
+          adjacent_difference</a></span></dt>
+<dt><span class="section"><a href="numeric/inner_product.html">
+          inner_product</a></span></dt>
+<dt><span class="section"><a href="numeric/partial_sum.html">
+          partial_sum</a></span></dt>
+</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="new/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="numeric/accumulate.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,156 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>accumulate</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../numeric.html" title="Numeric algorithms">
+<link rel="prev" href="../numeric.html" title="Numeric algorithms">
+<link rel="next" href="adjacent_difference.html" title="adjacent_difference">
+</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="../numeric.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="accumulate">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.numeric.accumulate"></a><a class="link" href="accumulate.html" title="accumulate"> accumulate</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.numeric.accumulate.prototype"></a><h6>
+<a name="id654333"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.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">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
+<span class="identifier">Value</span> <span class="identifier">accumulate</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
+                 <span class="identifier">Value</span> <span class="identifier">init</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryOperation</span>
+    <span class="special">&gt;</span>
+<span class="identifier">Value</span> <span class="identifier">accumulate</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
+                 <span class="identifier">Value</span> <span class="identifier">init</span><span class="special">,</span>
+                 <span class="identifier">BinaryOperation</span> <span class="identifier">op</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
+<a name="id654592"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">accumulate</span></code> is a generalisation
+            of summation. It computes a binary operation (<code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code> in the non-predicate version) of <code class="computeroutput"><span class="identifier">init</span></code> and all of the elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<p>
+            The return value is the resultant value of the above algorithm.
+          </p>
+<a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
+<a name="id654669"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.numeric.accumulate.requirements"></a><h6>
+<a name="id654732"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
+          </h6>
+<a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a><h6>
+<a name="id654756"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
+            the first version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+              An <code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code>
+              is defined for a left-hand operand of type <code class="computeroutput"><span class="identifier">Value</span></code>
+              and a right-hand operance of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              value type.
+            </li>
+<li class="listitem">
+              The return type of the above operator is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
+<a name="id654891"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
+            the second version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
+              type is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+              second argument type.
+            </li>
+<li class="listitem">
+              The return type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+              is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
+<a name="id655069"></a>
+            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="../numeric.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,179 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>adjacent_difference</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../numeric.html" title="Numeric algorithms">
+<link rel="prev" href="accumulate.html" title="accumulate">
+<link rel="next" href="inner_product.html" title="inner_product">
+</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="accumulate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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="inner_product.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="adjacent_difference">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.numeric.adjacent_difference"></a><a class="link" href="adjacent_difference.html" title="adjacent_difference">
+          adjacent_difference</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a><h6>
+<a name="id655140"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.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">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">adjacent_difference</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
+    <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryOperation</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">adjacent_difference</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
+    <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">,</span>
+    <span class="identifier">BinaryOperation</span> <span class="identifier">op</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
+<a name="id655401"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">adjacent_difference</span></code> calculates
+            the differences of adjacent_elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </p>
+<p>
+            The first version of <code class="computeroutput"><span class="identifier">adjacent_difference</span></code>
+            uses <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>
+            to calculate the differences. The second version uses <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+            instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
+          </p>
+<a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a><h6>
+<a name="id655506"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.numeric.adjacent_difference.requirements"></a><h6>
+<a name="id655569"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
+          </h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a><h6>
+<a name="id655593"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
+            the first version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+              If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+              value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
+              is defined.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+<li class="listitem">
+              The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
+              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
+<a name="id655790"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
+            the second version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+              first and second argument types.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+<li class="listitem">
+              The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
+<a name="id655972"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
+            <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
+          </p>
+<a name="range.reference.algorithms.numeric.adjacent_difference.complexity"></a><h6>
+<a name="id656046"></a>
+            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            then zero applications, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            applications are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="accumulate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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="inner_product.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,192 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>inner_product</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../numeric.html" title="Numeric algorithms">
+<link rel="prev" href="adjacent_difference.html" title="adjacent_difference">
+<link rel="next" href="partial_sum.html" title="partial_sum">
+</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="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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="partial_sum.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="inner_product">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.numeric.inner_product"></a><a class="link" href="inner_product.html" title="inner_product">
+          inner_product</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.numeric.inner_product.prototype"></a><h6>
+<a name="id656149"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.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">SinglePassRange1</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+    <span class="identifier">Value</span> <span class="identifier">inner_product</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">Value</span>                   <span class="identifier">init</span> <span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">BinaryOperation1</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">BinaryOperation2</span><span class="special">&gt;</span>
+    <span class="identifier">Value</span> <span class="identifier">inner_product</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">Value</span>                   <span class="identifier">init</span><span class="special">,</span>
+                         <span class="identifier">BinaryOperation1</span>        <span class="identifier">op1</span> <span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
+<a name="id656509"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">inner_product</span></code> calculates
+            a generalised inner product of the range <code class="computeroutput"><span class="identifier">rng1</span></code>
+            and <code class="computeroutput"><span class="identifier">rng2</span></code>.
+          </p>
+<p>
+            For further information on the <code class="computeroutput"><span class="identifier">inner_product</span></code>
+            algorithm please see inner_product.
+          </p>
+<a name="range.reference.algorithms.numeric.inner_product.definition"></a><h6>
+<a name="id656588"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.numeric.inner_product.requirements"></a><h6>
+<a name="id656650"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
+          </h6>
+<a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a><h6>
+<a name="id656674"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
+            the first version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+              If <code class="computeroutput"><span class="identifier">x</span></code> is an object of
+              type <code class="computeroutput"><span class="identifier">Value</span></code>, <code class="computeroutput"><span class="identifier">y</span></code> is an object of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type, and <code class="computeroutput"><span class="identifier">z</span></code> is
+              an object of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span> <span class="special">*</span> <span class="identifier">z</span></code>
+              is defined.
+            </li>
+<li class="listitem">
+              The result type of the expression <code class="computeroutput"><span class="identifier">x</span>
+              <span class="special">+</span> <span class="identifier">y</span>
+              <span class="special">*</span> <span class="identifier">z</span></code>
+              is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
+<a name="id656921"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
+            the second version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation1</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation2</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+              is convertible to the first argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+              is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to the value type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
+            </li>
+<li class="listitem">
+              The return type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>
+              is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
+            </li>
+<li class="listitem">
+              The return type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>
+              is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
+<a name="id657200"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is a valid range.
+          </p>
+<a name="range.reference.algorithms.numeric.inner_product.complexity"></a><h6>
+<a name="id657273"></a>
+            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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="partial_sum.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,161 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>partial_sum</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../numeric.html" title="Numeric algorithms">
+<link rel="prev" href="inner_product.html" title="inner_product">
+<link rel="next" href="../../ranges.html" title="Provided Ranges">
+</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="inner_product.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="partial_sum">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.numeric.partial_sum"></a><a class="link" href="partial_sum.html" title="partial_sum">
+          partial_sum</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.numeric.partial_sum.prototype"></a><h6>
+<a name="id657341"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.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">SinglePassRange</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">partial_sum</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+                           <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+         <span class="keyword">class</span> <span class="identifier">BinaryOperation</span><span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">partial_sum</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+                           <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">,</span>
+                           <span class="identifier">BinaryOperation</span> <span class="identifier">op</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
+<a name="id657593"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">partial_sum</span></code> calculates
+            a generalised partial sum of <code class="computeroutput"><span class="identifier">rng</span></code>
+            in the same manner as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>. See partial_sum.
+          </p>
+<a name="range.reference.algorithms.numeric.partial_sum.definition"></a><h6>
+<a name="id657732"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.numeric.partial_sum.requirements"></a><h6>
+<a name="id657794"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
+          </h6>
+<a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a><h6>
+<a name="id657818"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
+            the first version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+              If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+              value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
+              is defined.
+            </li>
+<li class="listitem">
+              The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
+              is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
+<a name="id658016"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
+            the second version</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+            </li>
+<li class="listitem">
+              The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+              is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
+            </li>
+<li class="listitem">
+              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+              set of value types.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
+<a name="id658169"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
+            <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
+          </p>
+<a name="range.reference.algorithms.numeric.partial_sum.complexity"></a><h6>
+<a name="id658243"></a>
+            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+            then zero applications, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
+            applications are performed.
+          </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="inner_product.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,50 @@
+<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.2">
+<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/sort_heap.html" title="sort_heap">
+<link rel="next" href="permutation/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/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/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"></a><a class="link" href="permutation.html" title="Permutation algorithms"> Permutation
+        algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="permutation/next_permutation.html">
+          next_permutation</a></span></dt>
+<dt><span class="section"><a href="permutation/prev_permutation.html">
+          prev_permutation</a></span></dt>
+</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/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/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,149 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>next_permutation</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../permutation.html" title="Permutation algorithms">
+<link rel="prev" href="../permutation.html" title="Permutation algorithms">
+<link rel="next" href="prev_permutation.html" title="prev_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="../permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.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="prev_permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="next_permutation">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.permutation.next_permutation"></a><a class="link" href="next_permutation.html" title="next_permutation">
+          next_permutation</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.permutation.next_permutation.prototype"></a><h6>
+<a name="id646664"></a>
+            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.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">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
+<a name="id647008"></a>
+            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">next_permutation</span></code> transforms
+            the range of elements <code class="computeroutput"><span class="identifier">rng</span></code>
+            into the lexicographically next greater permutation of the elements if
+            such a permutation exists. If one does not exist then the range is transformed
+            into the lexicographically smallest permutation and <code class="computeroutput"><span class="keyword">false</span></code>
+            is returned. <code class="computeroutput"><span class="keyword">true</span></code> is returned
+            when the next greater permutation is successfully generated.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
+<a name="id647112"></a>
+            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.permutation.next_permutation.requirements"></a><h6>
+<a name="id647184"></a>
+            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
+<a name="id647417"></a>
+            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
+            swaps.
+          </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="../permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.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="prev_permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,149 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>prev_permutation</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../permutation.html" title="Permutation algorithms">
+<link rel="prev" href="next_permutation.html" title="next_permutation">
+<link rel="next" href="../new.html" title="New 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="next_permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.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="../new.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="prev_permutation">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.permutation.prev_permutation"></a><a class="link" href="prev_permutation.html" title="prev_permutation">
+          prev_permutation</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a><h6>
+<a name="id647497"></a>
+            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.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">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
+<a name="id647842"></a>
+            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">prev_permutation</span></code> transforms
+            the range of elements <code class="computeroutput"><span class="identifier">rng</span></code>
+            into the lexicographically next smaller permutation of the elements if
+            such a permutation exists. If one does not exist then the range is transformed
+            into the lexicographically largest permutation and <code class="computeroutput"><span class="keyword">false</span></code>
+            is returned. <code class="computeroutput"><span class="keyword">true</span></code> is returned
+            when the next smaller permutation is successfully generated.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
+<a name="id647947"></a>
+            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.permutation.prev_permutation.requirements"></a><h6>
+<a name="id648020"></a>
+            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+              Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+              is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
+<a name="id648253"></a>
+            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
+            swaps.
+          </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="next_permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.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="../new.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,257 @@
+<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.2">
+<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="mutating.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="mutating.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">end</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="mutating.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,52 @@
+<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.2">
+<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="non_mutating/upper_bound.html" title="upper_bound">
+<link rel="next" href="set/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="non_mutating/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/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"></a><a class="link" href="set.html" title="Set algorithms"> Set algorithms</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> includes</span></dt>
+<dt><span class="section"> set_union</span></dt>
+<dt><span class="section"><a href="set/set_intersection.html">
+          set_intersection</a></span></dt>
+<dt><span class="section"> set_difference</span></dt>
+<dt><span class="section"><a href="set/set_symmetric_difference.html">
+          set_symmetric_difference</a></span></dt>
+</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="non_mutating/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/includes.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,186 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>includes</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../set.html" title="Set algorithms">
+<link rel="prev" href="../set.html" title="Set algorithms">
+<link rel="next" href="set_union.html" title="set_union">
+</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.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_union.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="includes">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes"> includes</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.set.includes.prototype"></a><h6>
+<a name="id636854"></a>
+            <a class="link" href="includes.html#range.reference.algorithms.set.includes.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">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+              <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>    
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.set.includes.description"></a><h6>
+<a name="id637131"></a>
+            <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">includes</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if and only if, for every element
+            in <code class="computeroutput"><span class="identifier">rng2</span></code>, an equivalent
+            element is also present in <code class="computeroutput"><span class="identifier">rng1</span></code>.
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.set.includes.definition"></a><h6>
+<a name="id637228"></a>
+            <a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.set.includes.requirements"></a><h6>
+<a name="id637298"></a>
+            <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
+<a name="id637681"></a>
+            <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.set.includes.complexity"></a><h6>
+<a name="id637796"></a>
+            <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+</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.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_union.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,205 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>set_difference</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../set.html" title="Set algorithms">
+<link rel="prev" href="set_intersection.html" title="set_intersection">
+<link rel="next" href="set_symmetric_difference.html" title="set_symmetric_difference">
+</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_intersection.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_symmetric_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="set_difference">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.set.set_difference"></a><a class="link" href="set_difference.html" title="set_difference"> set_difference</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.set.set_difference.prototype"></a><h6>
+<a name="id640270"></a>
+            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">set_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                              <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                              <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">set_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                              <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                              <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
+                              <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.set.set_difference.description"></a><h6>
+<a name="id640612"></a>
+            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">set_difference</span></code> constructs
+            a sorted range that is the set difference of the sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>.
+            The return value is the end of the output range.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
+<a name="id640702"></a>
+            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.set.set_difference.requirements"></a><h6>
+<a name="id640773"></a>
+            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
+<a name="id641207"></a>
+            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.set.set_difference.complexity"></a><h6>
+<a name="id641322"></a>
+            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+</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_intersection.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_symmetric_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,206 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>set_intersection</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../set.html" title="Set algorithms">
+<link rel="prev" href="set_union.html" title="set_union">
+<link rel="next" href="set_difference.html" title="set_difference">
+</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_union.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="set_intersection">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.set.set_intersection"></a><a class="link" href="set_intersection.html" title="set_intersection">
+          set_intersection</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.set.set_intersection.prototype"></a><h6>
+<a name="id639094"></a>
+            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                                <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                                <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                                <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                                <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
+                                <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>    
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
+<a name="id639436"></a>
+            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">set_intersection</span></code> constructs
+            a sorted range that is the intersection of the sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>.
+            The return value is the end of the output range.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
+<a name="id639526"></a>
+            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.set.set_intersection.requirements"></a><h6>
+<a name="id639597"></a>
+            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
+<a name="id640031"></a>
+            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.set.set_intersection.complexity"></a><h6>
+<a name="id640146"></a>
+            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+</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_union.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,210 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>set_symmetric_difference</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../set.html" title="Set algorithms">
+<link rel="prev" href="set_difference.html" title="set_difference">
+<link rel="next" href="../heap.html" title="Heap 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="set_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="set_symmetric_difference">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.set.set_symmetric_difference"></a><a class="link" href="set_symmetric_difference.html" title="set_symmetric_difference">
+          set_symmetric_difference</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a><h6>
+<a name="id641449"></a>
+            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span>
+<span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span>
+<span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
+                         <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>    
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
+<a name="id641792"></a>
+            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">set_symmetric_difference</span></code>
+            constructs a sorted range that is the set symmetric difference of the
+            sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
+            <code class="computeroutput"><span class="identifier">rng2</span></code>. The return value
+            is the end of the output range.
+          </p>
+<p>
+            The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
+<a name="id641883"></a>
+            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.set.set_symmetric_difference.requirements"></a><h6>
+<a name="id641955"></a>
+            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
+<a name="id642389"></a>
+            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a><h6>
+<a name="id642506"></a>
+            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+</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_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,204 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>set_union</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../set.html" title="Set algorithms">
+<link rel="prev" href="includes.html" title="includes">
+<link rel="next" href="set_intersection.html" title="set_intersection">
+</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="includes.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_intersection.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="set_union">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.set.set_union"></a><a class="link" href="set_union.html" title="set_union"> set_union</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.set.set_union.prototype"></a><h6>
+<a name="id637920"></a>
+            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.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">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
+    <span class="special">&gt;</span>
+<span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
+                         <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
+                         <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
+                         <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>    
+ </pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.set.set_union.description"></a><h6>
+<a name="id638262"></a>
+            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">set_union</span></code> constructs
+            a sorted range that is the union of the sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code>
+            and <code class="computeroutput"><span class="identifier">rng2</span></code>. The return
+            value is the end of the output range. The ordering relationship is determined
+            by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>
+            in the non-predicate versions, and by evaluating <code class="computeroutput"><span class="identifier">pred</span></code>
+            in the predicate versions.
+          </p>
+<a name="range.reference.algorithms.set.set_union.definition"></a><h6>
+<a name="id638349"></a>
+            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.definition">Definition</a>
+          </h6>
+<p>
+            Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+          </p>
+<a name="range.reference.algorithms.set.set_union.requirements"></a><h6>
+<a name="id638421"></a>
+            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
+              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
+              the same value type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              first argument type.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+              second argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
+<a name="id638855"></a>
+            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
+          </p>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
+            according to <code class="computeroutput"><span class="identifier">pred</span></code>.
+          </p>
+<a name="range.reference.algorithms.set.set_union.complexity"></a><h6>
+<a name="id638969"></a>
+            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
+            where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
+          </p>
+</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="includes.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_intersection.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,48 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Range concept implementation</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="overview.html" title="Overview">
+<link rel="next" href="concept_implementation/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="overview.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="concept_implementation/synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Range concept implementation">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.reference.concept_implementation"></a><a class="link" href="concept_implementation.html" title="Range concept implementation"> Range concept
+      implementation</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section">Synopsis</span></dt>
+<dt><span class="section">Semantics</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="overview.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="concept_implementation/synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,163 @@
+<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.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concept_implementation.html" title="Range concept implementation">
+<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="../concept_implementation.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><h4 class="title">
+<a name="range.reference.concept_implementation.semantics"></a><a class="link" href="semantics.html" title="Semantics">Semantics</a>
+</h4></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.concept_implementation.semantics.notation"></a><h6>
+<a name="id562424"></a>
+          <a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
+        </h6>
+<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="../concept_implementation.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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,408 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Functions</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../semantics.html" title="Semantics">
+<link rel="prev" href="metafunctions.html" title="Metafunctions">
+<link rel="next" href="../../adaptors.html" title="Range Adaptors">
+</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="metafunctions.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Functions">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.concept_implementation.semantics.functions"></a><a class="link" href="functions.html" title="Functions">Functions</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Expression
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Return type
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Returns
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Complexity
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
+                      is of type <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">T</span><span class="special">&gt;</span></code> <code class="computeroutput"><span class="identifier">a</span></code>
+                      if <code class="computeroutput"><span class="identifier">a</span></code> is an
+                      array <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> if that expression would invoke
+                      a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code> otherwise
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
+                      is of type <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">T</span><span class="special">&gt;</span></code> <code class="computeroutput"><span class="identifier">a</span>
+                      <span class="special">+</span> <span class="identifier">sz</span></code>
+                      if <code class="computeroutput"><span class="identifier">a</span></code> is an
+                      array of size <code class="computeroutput"><span class="identifier">sz</span></code>
+                      <code class="computeroutput"><span class="identifier">range_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                      if that expression would invoke a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
+                      otherwise
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="keyword">bool</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span>
+                      <span class="special">==</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</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">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      -
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span>
+                      <span class="special">-</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">const_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">const_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">const_rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">const_rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      constant time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">U</span><span class="special">&gt;</span></code> where <code class="computeroutput"><span class="identifier">U</span></code>
+                      is <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
+                      if <code class="computeroutput"><span class="identifier">x</span></code> is a pointer
+                      to a string and <code class="computeroutput"><span class="identifier">U</span></code>
+                      is <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                      otherwise
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="special">[</span><span class="identifier">s</span><span class="special">,</span><span class="identifier">s</span>
+                      <span class="special">+</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">char_traits</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">length</span><span class="special">(</span><span class="identifier">s</span><span class="special">))</span></code> if <code class="computeroutput"><span class="identifier">s</span></code>
+                      is a <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
+                      or an array of <code class="computeroutput"><span class="identifier">Char</span></code>
+                      <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">x</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">x</span><span class="special">))</span></code> otherwise
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      linear time for pointers to a string or arrays of <code class="computeroutput"><span class="identifier">Char</span></code>, constant time otherwise
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">as_array</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <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">x</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">x</span><span class="special">))</span></code>
+                    </p>
+                  </td>
+<td class="auto-generated">&#160;</td>
+</tr>
+</tbody>
+</table></div>
+<p>
+            The special <code class="computeroutput"><span class="identifier">const_</span></code>-named
+            functions are useful when you want to document clearly that your code
+            is read-only.
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">()</span></code>
+            can be used <span class="emphasis"><em><span class="bold"><strong>internally</strong></span></em></span>
+            in string algorithm libraries such that arrays of characters are handled
+            correctly.
+          </p>
+<p>
+            <code class="computeroutput"><span class="identifier">as_array</span><span class="special">()</span></code>
+            can be used with string algorithm libraries to make it clear that arrays
+            of characters are handled like an array and not like a string.
+          </p>
+<p>
+            Notice that the above functions should always be called with qualification
+            (<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span></code>)
+            to prevent <span class="emphasis"><em><span class="bold"><strong>unintended</strong></span></em></span>
+            Argument Dependent Lookup (ADL).
+          </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="metafunctions.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.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.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,236 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Metafunctions</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../semantics.html" title="Semantics">
+<link rel="prev" href="../semantics.html" title="Semantics">
+<link rel="next" href="functions.html" title="Functions">
+</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="../semantics.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.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="functions.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Metafunctions">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.concept_implementation.semantics.metafunctions"></a><a class="link" href="metafunctions.html" title="Metafunctions">Metafunctions</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Expression
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Return type
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Complexity
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">iterator</span>
+<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
+<span class="identifier">A</span><span class="special">*</span>
+</pre>
+<p>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">const_iterator</span>
+<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
+<span class="keyword">const</span> <span class="identifier">A</span><span class="special">*</span>
+</pre>
+<p>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_value</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_reference</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_pointer</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_category</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
+                      <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </p>
+                  </td>
+<td>
+                    <p>
+                      compile time
+                    </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="../semantics.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.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="functions.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,185 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Synopsis</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../concept_implementation.html" title="Range concept implementation">
+<link rel="prev" href="../concept_implementation.html" title="Range concept implementation">
+<link rel="next" href="semantics.html" title="Semantics">
+</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="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.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.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">
+<a name="range.reference.concept_implementation.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
+<span class="special">{</span>
+    <span class="comment">//
+</span>    <span class="comment">// Single Pass Range metafunctions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_iterator</span><span class="special">;</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_value</span><span class="special">;</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_reference</span><span class="special">;</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_pointer</span><span class="special">;</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_category</span><span class="special">;</span>
+
+    <span class="comment">//
+</span>    <span class="comment">// Forward Range metafunctions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_difference</span><span class="special">;</span>
+
+    <span class="comment">//
+</span>    <span class="comment">// Bidirectional Range metafunctions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">range_reverse_iterator</span><span class="special">;</span>
+
+    <span class="comment">//
+</span>    <span class="comment">// Single Pass Range functions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">end</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span>
+    <span class="identifier">empty</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="comment">//
+</span>    <span class="comment">// Forward Range functions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">distance</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="comment">//
+</span>    <span class="comment">// Bidirectional Range functions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">rend</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="comment">//
+</span>    <span class="comment">// Random Access Range functions
+</span>    <span class="comment">//
+</span>    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+    <span class="identifier">size</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="comment">//
+</span>    <span class="comment">// Special const Range functions
+</span>    <span class="comment">//
+</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="identifier">const_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="identifier">const_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="identifier">const_rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="identifier">const_rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="comment">//
+</span>    <span class="comment">// String utilities
+</span>    <span class="comment">//
+</span>    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
+    <span class="identifier">as_literal</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
+    <span class="identifier">as_literal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="identifier">as_array</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="identifier">as_array</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+<span class="special">}</span> <span class="comment">// namespace 'boost' 
+</span></pre>
+<p>
+        </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="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.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.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,51 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Extending the library</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="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">
+<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="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">
+<a name="range.reference.extending"></a><a class="link" href="extending.html" title="Extending the library"> Extending the library</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="extending/method_1.html"> Method 1: provide
+        member functions and nested types</a></span></dt>
+<dt><span class="section"><a href="extending/method_2.html"> Method 2: provide
+        free-standing functions and specialize metafunctions</a></span></dt>
+<dt><span class="section"><a href="extending/method_3.html"> Method 3: provide
+        range adaptor implementations</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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,161 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Method 1: provide member functions and nested types</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../extending.html" title="Extending the library">
+<link rel="prev" href="../extending.html" title="Extending the library">
+<link rel="next" href="method_2.html" title="Method 2: provide free-standing functions and specialize 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="../extending.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.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="method_2.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Method 1: provide member functions and nested types">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.extending.method_1"></a><a class="link" href="method_1.html" title="Method 1: provide member functions and nested types"> Method 1: provide
+        member functions and nested types</a>
+</h4></div></div></div>
+<p>
+          This procedure assumes that you have control over the types that should
+          be made conformant to a Range concept. If not, see <a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">method
+          2</a>.
+        </p>
+<p>
+          The primary templates in this library are implemented such that standard
+          containers will work automatically and so will boost::array.
+          Below is given an overview of which member functions and member types a
+          class must specify to be useable as a certain Range concept.
+        </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Member function
+                  </p>
+                </th>
+<th>
+                  <p>
+                    Related concept
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span></code>
+                  </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="identifier">end</span><span class="special">()</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
+                    Range</a>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+          Notice that <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">()</span></code>
+          and <code class="computeroutput"><span class="identifier">rend</span><span class="special">()</span></code>
+          member functions are not needed even though the container can support bidirectional
+          iteration.
+        </p>
+<p>
+          The required member types are:
+        </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Member type
+                  </p>
+                </th>
+<th>
+                  <p>
+                    Related concept
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><span class="identifier">iterator</span></code>
+                  </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="identifier">const_iterator</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
+                    Range</a>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+          Again one should notice that member types <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>
+          and <code class="computeroutput"><span class="identifier">const_reverse_iterator</span></code>
+          are not needed.
+        </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="../extending.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.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="method_2.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,267 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Method 2: provide free-standing functions and specialize metafunctions</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../extending.html" title="Extending the library">
+<link rel="prev" href="method_1.html" title="Method 1: provide member functions and nested types">
+<link rel="next" href="method_3.html" title="Method 3: provide range adaptor implementations">
+</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="method_1.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.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="method_3.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Method 2: provide free-standing functions and specialize metafunctions">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.extending.method_2"></a><a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions"> Method 2: provide
+        free-standing functions and specialize metafunctions</a>
+</h4></div></div></div>
+<p>
+          This procedure assumes that you cannot (or do not wish to) change the types
+          that should be made conformant to a Range concept. If this is not true,
+          see <a class="link" href="method_1.html" title="Method 1: provide member functions and nested types">method 1</a>.
+        </p>
+<p>
+          The primary templates in this library are implemented such that certain
+          functions are found via argument-dependent-lookup (ADL). Below is given
+          an overview of which free-standing functions a class must specify to be
+          useable as a certain Range concept. Let <code class="computeroutput"><span class="identifier">x</span></code>
+          be a variable (<code class="computeroutput"><span class="keyword">const</span></code> or <code class="computeroutput"><span class="keyword">mutable</span></code>) of the class in question.
+        </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Function
+                  </p>
+                </th>
+<th>
+                  <p>
+                    Related concept
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                  </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="identifier">range_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
+                    Range</a>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+          <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code>
+          and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code>
+          must be overloaded for both <code class="computeroutput"><span class="keyword">const</span></code>
+          and <code class="computeroutput"><span class="keyword">mutable</span></code> reference arguments.
+        </p>
+<p>
+          You must also specialize two metafunctions for your type <code class="computeroutput"><span class="identifier">X</span></code>:
+        </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Metafunction
+                  </p>
+                </th>
+<th>
+                  <p>
+                    Related concept
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_mutable_iterator</span></code>
+                  </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="identifier">boost</span><span class="special">::</span><span class="identifier">range_const_iterator</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
+                    Range</a>
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+          A complete example is given here:
+        </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">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>         <span class="comment">// for std::iterator_traits, std::distance()
+</span>
+<span class="keyword">namespace</span> <span class="identifier">Foo</span>
+<span class="special">{</span>
+    <span class="comment">//
+</span>    <span class="comment">// Our sample UDT. A 'Pair'
+</span>    <span class="comment">// will work as a range when the stored
+</span>    <span class="comment">// elements are iterators.
+</span>    <span class="comment">//
+</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="keyword">struct</span> <span class="identifier">Pair</span>
+    <span class="special">{</span>
+        <span class="identifier">T</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">;</span>
+    <span class="special">};</span>
+
+<span class="special">}</span> <span class="comment">// namespace 'Foo'
+</span>
+<span class="keyword">namespace</span> <span class="identifier">boost</span>
+<span class="special">{</span>
+    <span class="comment">//
+</span>    <span class="comment">// Specialize metafunctions. We must include the range.hpp header.
+</span>    <span class="comment">// We must open the 'boost' namespace.
+</span>    <span class="comment">//
+</span>
+	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+	<span class="keyword">struct</span> <span class="identifier">range_mutable_iterator</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+	<span class="special">{</span>
+		<span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
+	<span class="special">};</span>
+
+	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+	<span class="keyword">struct</span> <span class="identifier">range_const_iterator</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+	<span class="special">{</span>
+		<span class="comment">//
+</span>		<span class="comment">// Remark: this is defined similar to 'range_iterator'
+</span>		<span class="comment">//         because the 'Pair' type does not distinguish
+</span>		<span class="comment">//         between an iterator and a const_iterator.
+</span>		<span class="comment">//
+</span>		<span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
+	<span class="special">};</span>
+
+<span class="special">}</span> <span class="comment">// namespace 'boost'
+</span>
+<span class="keyword">namespace</span> <span class="identifier">Foo</span>
+<span class="special">{</span>
+	<span class="comment">//
+</span>	<span class="comment">// The required functions. These should be defined in
+</span>	<span class="comment">// the same namespace as 'Pair', in this case
+</span>	<span class="comment">// in namespace 'Foo'.
+</span>	<span class="comment">//
+</span>
+	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+	<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_begin</span><span class="special">(</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
+	<span class="special">{</span>
+		<span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first</span><span class="special">;</span>
+	<span class="special">}</span>
+
+	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+	<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
+	<span class="special">{</span>
+		<span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first</span><span class="special">;</span>
+	<span class="special">}</span>
+
+	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+	<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_end</span><span class="special">(</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
+	<span class="special">{</span>
+		<span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last</span><span class="special">;</span>
+	<span class="special">}</span>
+
+	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+	<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
+	<span class="special">{</span>
+		<span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last</span><span class="special">;</span>
+	<span class="special">}</span>
+
+<span class="special">}</span> <span class="comment">// namespace 'Foo'
+</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+	<span class="keyword">typedef</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">iter</span><span class="special">;</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="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span>                     <span class="identifier">pair</span> <span class="special">=</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="special">};</span>
+	<span class="keyword">const</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;&amp;</span>              <span class="identifier">cpair</span> <span class="special">=</span> <span class="identifier">pair</span><span class="special">;</span>
+	<span class="comment">//
+</span>	<span class="comment">// Notice that we call 'begin' etc with qualification.
+</span>	<span class="comment">//
+</span>	<span class="identifier">iter</span> <span class="identifier">i</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">pair</span> <span class="special">);</span>
+	<span class="identifier">iter</span> <span class="identifier">e</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">pair</span> <span class="special">);</span>
+	<span class="identifier">i</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">cpair</span> <span class="special">);</span>
+	<span class="identifier">e</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">cpair</span> <span class="special">);</span>
+	<span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span> <span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">s</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
+	<span class="identifier">s</span>      <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
+	<span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span> <span class="keyword">const</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span> <span class="special">&gt;::</span><span class="identifier">type</span>
+	<span class="identifier">ri</span>     <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">),</span>
+	<span class="identifier">re</span>     <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
+
+	<span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+        </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="method_1.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.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="method_3.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Method 3: provide range adaptor implementations</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../extending.html" title="Extending the library">
+<link rel="prev" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
+<link rel="next" href="method_3/method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
+</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="method_2.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.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="method_3/method_3_1.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Method 3: provide range adaptor implementations">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.extending.method_3"></a><a class="link" href="method_3.html" title="Method 3: provide range adaptor implementations"> Method 3: provide
+        range adaptor implementations</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="method_3/method_3_1.html"> Method
+          3.1: Implement a Range Adaptor without arguments</a></span></dt>
+<dt><span class="section"><a href="method_3/method_3_2.html"> Method
+          3.2: Implement a Range Adaptor with arguments</a></span></dt>
+</dl></div>
+</div>
+<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="method_2.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.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="method_3/method_3_1.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,100 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Method 3.1: Implement a Range Adaptor without arguments</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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.html" title="Method 3: provide range adaptor implementations">
+<link rel="next" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
+</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="../method_3.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="method_3_2.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Method 3.1: Implement a Range Adaptor without arguments">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.extending.method_3.method_3_1"></a><a class="link" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments"> Method
+          3.1: Implement a Range Adaptor without arguments</a>
+</h5></div></div></div>
+<p>
+            To implement a Range Adaptor without arguments (e.g. reversed) you need
+            to:
+          </p>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+              Provide a range for your return type, for example: 
+<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">iterator_range</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">boost</span><span class="special">/</span><span class="identifier">iterator</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>
+
+<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">R</span> <span class="special">&gt;</span>
+<span class="keyword">struct</span> <span class="identifier">reverse_range</span> <span class="special">:</span>
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span>
+        <span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span>
+            <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="special">{</span>
+<span class="keyword">private</span><span class="special">:</span>
+    <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span>
+        <span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span>
+            <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">&gt;</span> <span class="identifier">base</span><span class="special">;</span>
+
+<span class="keyword">public</span><span class="special">:</span>
+    <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span>
+        <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span> <span class="identifier">iterator</span><span class="special">;</span>
+
+    <span class="identifier">reverse_range</span><span class="special">(</span><span class="identifier">R</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">)</span>
+        <span class="special">:</span> <span class="identifier">base</span><span class="special">(</span><span class="identifier">iterator</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">r</span><span class="special">)),</span> <span class="identifier">iterator</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">r</span><span class="special">)))</span>
+    <span class="special">{</span> <span class="special">}</span>
+<span class="special">};</span>
+</pre>
+</li>
+<li class="listitem">
+              Provide a tag to uniquely identify your adaptor in the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
+              function overload set 
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">detail</span> <span class="special">{</span>
+    <span class="keyword">struct</span> <span class="identifier">reverse_forwarder</span> <span class="special">{};</span>
+<span class="special">}</span>
+</pre>
+</li>
+<li class="listitem">
+              Implement <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code><pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">BidirectionalRng</span> <span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="identifier">BidirectionalRng</span><span class="special">&gt;</span>
+<span class="keyword">operator</span><span class="special">|(</span> <span class="identifier">BidirectionalRng</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="special">)</span>
+<span class="special">{</span>
+	<span class="keyword">return</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="identifier">BidirectionalRng</span><span class="special">&gt;(</span> <span class="identifier">r</span> <span class="special">);</span>
+<span class="special">}</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">BidirectionalRng</span> <span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&gt;</span>
+<span class="keyword">operator</span><span class="special">|(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="special">)</span>
+<span class="special">{</span>
+	<span class="keyword">return</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&gt;(</span> <span class="identifier">r</span> <span class="special">);</span>
+<span class="special">}</span>
+</pre>
+</li>
+</ol></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="../method_3.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="method_3_2.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,155 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Method 3.2: Implement a Range Adaptor with arguments</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="../../../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>
+<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="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">
+<a name="range.reference.extending.method_3.method_3_2"></a><a class="link" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments"> Method
+          3.2: Implement a Range Adaptor with arguments</a>
+</h5></div></div></div>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+              Provide a range for your return type, for example: 
+<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">adaptor</span><span class="special">/</span><span class="identifier">argument_fwd</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">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>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">transform_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="keyword">class</span> <span class="identifier">replace_value</span>
+<span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+    <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">result_type</span><span class="special">;</span>
+    <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">argument_type</span><span class="special">;</span>
+
+    <span class="identifier">replace_value</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">to</span><span class="special">)</span>
+        <span class="special">:</span> <span class="identifier">m_from</span><span class="special">(</span><span class="identifier">from</span><span class="special">),</span> <span class="identifier">m_to</span><span class="special">(</span><span class="identifier">to</span><span class="special">)</span>
+    <span class="special">{</span>
+    <span class="special">}</span>
+
+    <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span>
+    <span class="special">{</span>
+        <span class="keyword">return</span> <span class="special">(</span><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">m_from</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">m_to</span> <span class="special">:</span> <span class="identifier">x</span><span class="special">;</span>
+    <span class="special">}</span>
+<span class="keyword">private</span><span class="special">:</span>
+    <span class="identifier">Value</span> <span class="identifier">m_from</span><span class="special">;</span>
+    <span class="identifier">Value</span> <span class="identifier">m_to</span><span class="special">;</span>
+<span class="special">};</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">&gt;</span>
+<span class="keyword">class</span> <span class="identifier">replace_range</span>
+<span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span>
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">transform_iterator</span><span class="special">&lt;</span>
+        <span class="identifier">replace_value</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;,</span>
+        <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="special">{</span>
+<span class="keyword">private</span><span class="special">:</span>
+    <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">value_type</span><span class="special">;</span>
+    <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">iterator_base</span><span class="special">;</span>
+    <span class="keyword">typedef</span> <span class="identifier">replace_value</span><span class="special">&lt;</span><span class="identifier">value_type</span><span class="special">&gt;</span> <span class="identifier">Fn</span><span class="special">;</span>
+    <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">transform_iterator</span><span class="special">&lt;</span><span class="identifier">Fn</span><span class="special">,</span> <span class="identifier">iterator_base</span><span class="special">&gt;</span> <span class="identifier">replaced_iterator</span><span class="special">;</span>
+    <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">replaced_iterator</span><span class="special">&gt;</span> <span class="identifier">base_t</span><span class="special">;</span>
+
+<span class="keyword">public</span><span class="special">:</span>
+    <span class="identifier">replace_range</span><span class="special">(</span><span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="identifier">from</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="identifier">to</span><span class="special">)</span>
+        <span class="special">:</span> <span class="identifier">base_t</span><span class="special">(</span><span class="identifier">replaced_iterator</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">Fn</span><span class="special">(</span><span class="identifier">from</span><span class="special">,</span><span class="identifier">to</span><span class="special">)),</span>
+                 <span class="identifier">replaced_iterator</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">Fn</span><span class="special">(</span><span class="identifier">from</span><span class="special">,</span><span class="identifier">to</span><span class="special">)))</span>
+     <span class="special">{</span>
+     <span class="special">}</span>
+ <span class="special">};</span>
+</pre>
+</li>
+<li class="listitem">
+              Implement a holder class to hold the arguments required to construct
+              the RangeAdaptor.
+            </li>
+</ol></div>
+<p>
+            The holder combines multiple parameters into one that can be passed as
+            the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
+          </p>
+<p>
+            
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
+<span class="keyword">class</span> <span class="identifier">replace_holder</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span>
+<span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+    <span class="identifier">replace_holder</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">to</span><span class="special">)</span>
+        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">from</span><span class="special">,</span> <span class="identifier">to</span><span class="special">)</span>
+    <span class="special">{</span> <span class="special">}</span>
+<span class="keyword">private</span><span class="special">:</span>
+    <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">=(</span><span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&amp;);</span>
+<span class="special">};</span>
+</pre>
+<p>
+          </p>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+              Define an instance of the holder with the name of the adaptor
+            </li></ol></div>
+<p>
+            
+</p>
+<pre class="programlisting"><span class="keyword">static</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;</span>
+<span class="identifier">replaced</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;();</span>
+</pre>
+<p>
+          </p>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+              Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
+</li></ol></div>
+<p>
+            
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
+<span class="keyword">operator</span><span class="special">|(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+          <span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;&amp;</span> <span class="identifier">f</span><span class="special">)</span>
+<span class="special">{</span>
+    <span class="keyword">return</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val1</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val2</span><span class="special">);</span>
+<span class="special">}</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
+<span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
+<span class="keyword">operator</span><span class="special">|(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+          <span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;&amp;</span> <span class="identifier">f</span><span class="special">)</span>
+<span class="special">{</span>
+    <span class="keyword">return</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val1</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val2</span><span class="special">);</span>
+<span class="special">}</span>
+</pre>
+<p>
+          </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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/overview.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/overview.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,68 @@
+<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.2">
+<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="concept_implementation.html" title="Range concept implementation">
+</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="concept_implementation.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="concept_implementation.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,48 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Provided Ranges</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/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">
+<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/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">
+<a name="range.reference.ranges"></a><a class="link" href="ranges.html" title="Provided Ranges"> Provided Ranges</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> counting_range</span></dt>
+<dt><span class="section"> istream_range</span></dt>
+<dt><span class="section"> irange</span></dt>
+</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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,90 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>counting_range</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="../ranges.html" title="Provided Ranges">
+<link rel="next" href="istream_range.html" title="istream_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="../ranges.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="istream_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="counting_range">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range"> counting_range</a>
+</h4></div></div></div>
+<a name="range.reference.ranges.counting_range.prototype"></a><h6>
+<a name="id658363"></a>
+          <a class="link" href="counting_range.html#range.reference.ranges.counting_range.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">Incrementable</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="identifier">Incrementable</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">Incrementable</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Incrementable</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">SinglePassRange</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">counting_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<a name="range.reference.ranges.counting_range.description"></a><h6>
+<a name="id658736"></a>
+          <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
+        </h6>
+<p>
+          <code class="computeroutput"><span class="identifier">counting_range</span></code> is a function
+          to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+          wrapping a <code class="computeroutput"><span class="identifier">counting_iterator</span></code>
+          (from Boost.Iterator).
+        </p>
+<a name="range.reference.ranges.counting_range.definition"></a><h6>
+<a name="id658794"></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="id658856"></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">
+<code class="computeroutput"><span class="identifier">Incrementable</span></code> is a model
+            of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
+            Concept.
+          </li></ol></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="../ranges.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="istream_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,103 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>irange</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="../utilities.html" title="Utilities">
+</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="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="id659288"></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">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">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="id659576"></a>
+          <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
+        </h6>
+<p>
+          <code class="computeroutput"><span class="identifier">irange</span></code> is a function to
+          generate an Integer Range.
+        </p>
+<p>
+          <code class="computeroutput"><span class="identifier">irange</span></code> allows treating
+          integers as a model of the <a class="link" href="../../concepts/random_access_range.html" title="Random Access Range">Random
+          Access Range</a> Concept. It should be noted that the <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code>
+          parameters denoted a half-open range.
+        </p>
+<a name="range.reference.ranges.irange.definition"></a><h6>
+<a name="id659656"></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="id659718"></a>
+          <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
+        </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Integer</span></code> is a model of
+            the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
+          </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">StepSize</span></code> is a model of
+            the <code class="computeroutput"><span class="identifier">SignedInteger</span></code> Concept.
+          </li>
+</ol></div>
+<a name="range.reference.ranges.irange.complexity"></a><h6>
+<a name="id659796"></a>
+          <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
+        </h6>
+<p>
+          Constant. Since this function generates a new range the most significant
+          performance cost is incurred through the iteration of the generated range.
+        </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="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>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,72 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>istream_range</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="counting_range.html" title="counting_range">
+<link rel="next" href="irange.html" title="irange">
+</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="counting_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="irange.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="istream_range">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range"> istream_range</a>
+</h4></div></div></div>
+<a name="range.reference.ranges.istream_range.prototype"></a><h6>
+<a name="id658929"></a>
+          <a class="link" href="istream_range.html#range.reference.ranges.istream_range.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">Type</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="identifier">istream_range</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_istream</span><span class="special">&lt;</span><span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">in</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<a name="range.reference.ranges.istream_range.description"></a><h6>
+<a name="id659142"></a>
+          <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
+        </h6>
+<p>
+          <code class="computeroutput"><span class="identifier">istream_range</span></code> is a function
+          to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+          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="id659209"></a>
+          <a class="link" href="istream_range.html#range.reference.ranges.istream_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">istream_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
+        </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="counting_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="irange.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,83 @@
+<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.2">
+<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="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="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="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><h3 class="title">
+<a name="range.reference.utilities"></a><a class="link" href="utilities.html" title="Utilities"> Utilities</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"> Class iterator_range</span></dt>
+<dt><span class="section"> Class sub_range</span></dt>
+<dt><span class="section"> Function join</span></dt>
+</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="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="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="utilities/iterator_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,328 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Class iterator_range</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../utilities.html" title="Utilities">
+<link rel="prev" href="../utilities.html" title="Utilities">
+<link rel="next" href="sub_range.html" title="Class sub_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="../utilities.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.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="sub_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Class iterator_range">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range"> Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
+</h4></div></div></div>
+<p>
+          The intention of the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+          class is to encapsulate two iterators so they fulfill the <a class="link" href="../../concepts/forward_range.html" title="Forward Range">Forward
+          Range</a> concept. A few other functions are also provided for convenience.
+        </p>
+<p>
+          If the template argument is not a model of <a href="../../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
+          Traversal Iterator</a>, one can still use a subset of the interface.
+          In particular, <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span></code>
+          requires Random Access Traversal Iterators whereas <code class="computeroutput"><span class="identifier">empty</span><span class="special">()</span></code> only requires Single Pass Iterators.
+        </p>
+<p>
+          Recall that many default constructed iterators are <span class="bold"><strong><span class="emphasis"><em>singular</em></span></strong></span>
+          and hence can only be assigned, but not compared or incremented or anything.
+          However, if one creates a default constructed <code class="computeroutput"><span class="identifier">iterator_range</span></code>,
+          then one can still call all its member functions. This design decision
+          avoids the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+          imposing limitations upon ranges of iterators that are not singular. Any
+          singularity limitation is simply propogated from the underlying iterator
+          type.
+        </p>
+<a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
+<a name="id660169"></a>
+          <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
+        </h5>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
+<span class="special">{</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
+    <span class="keyword">class</span> <span class="identifier">iterator_range</span>
+    <span class="special">{</span>
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types
+</span>        <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span>   <span class="identifier">iterator</span><span class="special">;</span>
+        <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span>   <span class="identifier">const_iterator</span><span class="special">;</span>
+        <span class="keyword">typedef</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
+
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
+</span>        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
+        <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">End</span> <span class="special">);</span>
+                    
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+        <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+  
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+        <span class="identifier">iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+        
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+        <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+        <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
+</span>        <span class="identifier">iterator</span>  <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">iterator</span>  <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
+</span>        <span class="keyword">operator</span>    <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="keyword">bool</span>        <span class="identifier">equal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_begin</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
+        <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_end</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
+        <span class="keyword">bool</span>      <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="comment">// for Random Access Range only: 
+</span>        <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">value_type</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+    <span class="special">};</span>
+    
+    <span class="comment">// stream output
+</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span>
+    <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span> 
+    <span class="keyword">operator</span><span class="special">&lt;&lt;(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">Os</span><span class="special">,</span>
+                <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="comment">// comparison
+</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+                     <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+                     <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+                    <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+                    <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+                    <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+ 
+    <span class="comment">// external construction
+</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> 
+                         <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
+       
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
+                         <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
+                         <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
+    
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> 
+                         <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
+                         <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
+    
+    <span class="comment">// convenience
+</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+    
+<span class="special">}</span> <span class="comment">// namespace 'boost'
+</span></pre>
+<p>
+        </p>
+<p>
+          If an instance of <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+          is constructed by a client with two iterators, the client must ensure that
+          the two iterators delimit a valid closed-open range [begin,end).
+        </p>
+<p>
+          It is worth noticing that the templated constructors and assignment operators
+          allow conversion from <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span></code> to <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code>. 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.
+        </p>
+<a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
+<a name="id663315"></a>
+          <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
+          member functions</a>
+        </h5>
+<p>
+          <code class="computeroutput"><span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">();</span></code>
+            </p>
+<p>
+          </p>
+</blockquote></div>
+<p>
+          <code class="computeroutput"><span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></code>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span>
+              <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">&amp;&amp;</span>
+              <span class="identifier">end</span><span class="special">()</span>
+              <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span></code>
+            </p>
+<p>
+          </p>
+</blockquote></div>
+<a name="range.reference.utilities.iterator_range.details_functions"></a><h5>
+<a name="id663553"></a>
+          <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
+          functions</a>
+        </h5>
+<p>
+          <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
+          <span class="identifier">l</span><span class="special">,</span>
+          <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span></code>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">l</span><span class="special">)</span> <span class="special">!=</span> <span class="identifier">size</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">?</span> <span class="keyword">false</span> <span class="special">:</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span>
+              <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
+            </p>
+<p>
+          </p>
+</blockquote></div>
+<p>
+          <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
+          <span class="identifier">l</span><span class="special">,</span>
+          <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span></code>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!(</span> <span class="identifier">l</span> <span class="special">==</span> <span class="identifier">r</span> <span class="special">);</span></code>
+            </p>
+<p>
+          </p>
+</blockquote></div>
+<p>
+          <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
+          <span class="identifier">l</span><span class="special">,</span>
+          <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span></code>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">lexicographical_compare</span><span class="special">(</span>
+              <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
+            </p>
+<p>
+          </p>
+</blockquote></div>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="identifier">iterator_range</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
+                                    <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span> 
+                                    <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
+            </p>
+<p>
+          </p>
+</blockquote></div>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">new_begin</span> <span class="special">=</span> <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">),</span>
+<span class="identifier">iterator</span> <span class="identifier">new_end</span>   <span class="special">=</span> <span class="identifier">end</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">);</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">advance_begin</span> <span class="special">);</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_end</span><span class="special">,</span> <span class="identifier">advance_end</span> <span class="special">);</span>
+<span class="keyword">return</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">new_end</span> <span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          <code class="computeroutput"><span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span>
+          <span class="identifier">r</span> <span class="special">);</span></code>
+        </p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>
+            </p>
+<p>
+              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">Sequence</span><span class="special">(</span>
+              <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
+            </p>
+<p>
+          </p>
+</blockquote></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="../utilities.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.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="sub_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,89 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Function join</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../utilities.html" title="Utilities">
+<link rel="prev" href="sub_range.html" title="Class sub_range">
+<link rel="next" href="../extending.html" title="Extending the library">
+</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="sub_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.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>
+</div>
+<div class="section" title="Function join">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.utilities.join"></a><a class="link" href="join.html" title="Function join"> Function join</a>
+</h4></div></div></div>
+<p>
+          The intention of the <code class="computeroutput"><span class="identifier">join</span></code>
+          function is to join two ranges into one longer range.
+        </p>
+<p>
+          The resultant range will have the lowest common traversal of the two ranges
+          supplied as parameters.
+        </p>
+<p>
+          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.
+        </p>
+<a name="range.reference.utilities.join.synposis"></a><h5>
+<a name="id666200"></a>
+          <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
+        </h5>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">&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">join_iterator</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">add_const</span><span class="special">&lt;</span>
+        <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
+<span class="special">&gt;</span>
+<span class="identifier">join</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">)</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">&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">join_iterator</span><span class="special">&lt;</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
+<span class="special">&gt;</span>
+<span class="identifier">join</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<a name="range.reference.utilities.join.example"></a><h5>
+<a name="id666734"></a>
+          <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
+        </h5>
+<p>
+          The expression <code class="computeroutput"><span class="identifier">join</span><span class="special">(</span><span class="identifier">irange</span><span class="special">(</span><span class="number">0</span><span class="special">,</span><span class="number">5</span><span class="special">),</span> <span class="identifier">irange</span><span class="special">(</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">))</span></code> would
+          evaluate to a range representing an integer range <code class="computeroutput"><span class="special">[</span><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">)</span></code>
+        </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#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="sub_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.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>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,123 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Class sub_range</title>
+<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../utilities.html" title="Utilities">
+<link rel="prev" href="iterator_range.html" title="Class iterator_range">
+<link rel="next" href="join.html" title="Function join">
+</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="iterator_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.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="join.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Class sub_range">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="range.reference.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range"> Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
+</h4></div></div></div>
+<p>
+          The <code class="computeroutput"><span class="identifier">sub_range</span></code> class inherits
+          all its functionality from the <a class="link" href="iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> class. The <code class="computeroutput"><span class="identifier">sub_range</span></code> class is often easier to use
+          because one must specify the <a class="link" href="../../concepts/forward_range.html" title="Forward Range">Forward
+          Range</a> template argument instead of an iterator. Moreover, the <code class="computeroutput"><span class="identifier">sub_range</span></code> class can propagate constness
+          since it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
+          is.
+        </p>
+<a name="range.reference.utilities.sub_range.synopsis"></a><h5>
+<a name="id664954"></a>
+          <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
+        </h5>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
+<span class="special">{</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+    <span class="keyword">class</span> <span class="identifier">sub_range</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
+    <span class="special">{</span>
+    <span class="keyword">public</span><span class="special">:</span> 
+        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">iterator</span><span class="special">;</span>
+        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>  <span class="identifier">const_iterator</span><span class="special">;</span>
+        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
+    
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
+</span>        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
+        <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
+
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
+        <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+         
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
+        <span class="identifier">sub_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+         
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
+        <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
+        <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>    
+    
+    <span class="keyword">public</span><span class="special">:</span>  <span class="comment">// Forward Range functions 
+</span>        <span class="identifier">iterator</span>        <span class="identifier">begin</span><span class="special">();</span>
+        <span class="identifier">const_iterator</span>  <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">iterator</span>        <span class="identifier">end</span><span class="special">();</span>
+        <span class="identifier">const_iterator</span>  <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>    
+        
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience 
+</span>        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="identifier">front</span><span class="special">();</span>
+        <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="identifier">back</span><span class="special">();</span>
+        <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="comment">// for Random Access Range only: 
+</span>        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
+        <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+    
+    <span class="keyword">public</span><span class="special">:</span>
+        <span class="comment">// rest of interface inherited from iterator_range
+</span>    <span class="special">};</span>
+    
+<span class="special">}</span> <span class="comment">// namespace 'boost'
+</span></pre>
+<p>
+        </p>
+<p>
+          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
+          <code class="computeroutput"><span class="identifier">sub_range</span></code>
+        </p>
+<p>
+          
+</p>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"hello"</span><span class="special">);</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">ir</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
+<span class="identifier">sub_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;</span>               <span class="identifier">sub</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
+</pre>
+<p>
+        </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="iterator_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.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="join.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,141 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Terminology and style guidelines</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="library_headers.html" title="Library Headers">
+</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="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">
+<a name="range.style_guide"></a><a class="link" href="style_guide.html" title="Terminology and style guidelines"> Terminology and style guidelines</a>
+</h2></div></div></div>
+<p>
+      The use of a consistent terminology is as important for <a class="link" href="concepts.html" title="Range Concepts">Ranges</a>
+      and range-based algorithms as it is for iterators and iterator-based algorithms.
+      If a conventional set of names are adopted, we can avoid misunderstandings
+      and write generic function prototypes that are <span class="bold"><strong><span class="emphasis"><em>self-documenting</em></span></strong></span>.
+    </p>
+<p>
+      Since ranges are characterized by a specific underlying iterator type, we get
+      a type of range for each type of iterator. Hence we can speak of the following
+      types of ranges:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
+        <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+            Readable Range
+          </li>
+<li class="listitem">
+            Writeable Range
+          </li>
+<li class="listitem">
+            Swappable Range
+          </li>
+<li class="listitem">
+            Lvalue Range
+          </li>
+</ul></div>
+</li>
+<li class="listitem">
+<span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
+        <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem"><a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a></li>
+<li class="listitem"><a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a></li>
+<li class="listitem"><a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a></li>
+<li class="listitem"><a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access Range</a></li>
+</ul></div>
+</li>
+</ul></div>
+<p>
+      Notice how we have used the categories from the <a href="../../../../../libs/iterator/doc/new-iter-concepts.html" target="_top">new
+      style iterators</a>.
+    </p>
+<p>
+      Notice that an iterator (and therefore an range) has one <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
+      property and one or more properties from the <span class="bold"><strong><span class="emphasis"><em>value
+      access</em></span></strong></span> category. So in reality we will mostly talk about
+      mixtures such as
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+        Random Access Readable Writeable Range
+      </li>
+<li class="listitem">
+        Forward Lvalue Range
+      </li>
+</ul></div>
+<p>
+      By convention, we should always specify the <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
+      property first as done above. This seems reasonable since there will only be
+      one <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span> property,
+      but perhaps many <span class="bold"><strong><span class="emphasis"><em>value access</em></span></strong></span>
+      properties.
+    </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="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>
+      property (Single Pass).
+    </p>
+<p>
+      As another example, consider how we specify the interface of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>. Algorithms are usually more cumbersome to
+      specify the interface of since both <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
+      and <span class="bold"><strong><span class="emphasis"><em>value access</em></span></strong></span> properties
+      must be exactly defined. The iterator-based version looks like this:
+    </p>
+<p>
+      
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="special">&gt;</span>
+<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">first</span><span class="special">,</span>
+           <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">last</span> <span class="special">);</span>
+</pre>
+<p>
+    </p>
+<p>
+      For ranges the interface becomes
+    </p>
+<p>
+      
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessReadableWritableRange</span> <span class="special">&gt;</span>
+<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessReadableWritableRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+</pre>
+<p>
+    </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="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,49 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Upgrade version of Boost.Range</title>
+<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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="mfc_atl/references.html" title="References">
+<link rel="next" href="upgrade/upgrade_from_1_42.html" title="Upgrade from version 1.42">
+</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="mfc_atl/references.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="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Upgrade version of Boost.Range">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="range.upgrade"></a><a class="link" href="upgrade.html" title="Upgrade version of Boost.Range"> Upgrade version of Boost.Range</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="upgrade/upgrade_from_1_42.html"> Upgrade from version
+      1.42</a></span></dt>
+<dt><span class="section"><a href="upgrade/upgrade_from_1_34.html"> Upgrade from version
+      1.34</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="mfc_atl/references.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="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,76 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Upgrade from version 1.34</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="prev" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">
+<link rel="next" href="../portability.html" title="Portability">
+</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="upgrade_from_1_42.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.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="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Upgrade from version 1.34">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.upgrade.upgrade_from_1_34"></a><a class="link" href="upgrade_from_1_34.html" title="Upgrade from version 1.34"> Upgrade from version
+      1.34</a>
+</h3></div></div></div>
+<p>
+        Boost version 1.35 introduced some larger refactorings of the library:
+      </p>
+<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/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/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
+          of <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+</li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">boost_range_begin</span><span class="special">()</span></code>
+          and <code class="computeroutput"><span class="identifier">boost_range_end</span><span class="special">()</span></code>
+          have been renamed <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code> respectively.
+        </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">range_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> and <code class="computeroutput"><span class="identifier">range_reverse_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+          have been renamed <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+          and <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+        </li>
+<li class="listitem">
+          The procedure that makes a custom type work with the library has been greatly
+          simplified. See <a class="link" href="../reference/extending.html" title="Extending the library">Extending the
+          library for UDTs</a> for details.
+        </li>
+</ol></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="upgrade_from_1_42.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.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="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html	2010-05-15 15:39:51 EDT (Sat, 15 May 2010)
@@ -0,0 +1,64 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Upgrade from version 1.42</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="next" href="upgrade_from_1_34.html" title="Upgrade from version 1.34">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<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="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.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="upgrade_from_1_34.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Upgrade from version 1.42">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.upgrade.upgrade_from_1_42"></a><a class="link" href="upgrade_from_1_42.html" title="Upgrade from version 1.42"> Upgrade from version
+      1.42</a>
+</h3></div></div></div>
+<p>
+        New features:
+      </p>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem"><a class="link" href="../reference/adaptors.html" title="Range Adaptors">Range adaptors</a></li>
+<li class="listitem"><a class="link" href="../reference/algorithms.html" title="Range Algorithm">Range algorithms</a></li>
+</ol></div>
+<p>
+        Removed:
+      </p>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<code class="computeroutput"><span class="identifier">iterator_range</span></code> no longer
+          has a <code class="computeroutput"><span class="identifier">is_singular</span></code> member
+          function. The singularity restrictions have been removed from the <code class="computeroutput"><span class="identifier">iterator_range</span></code> class since this added
+          restrictions to ranges of iterators whose default constructors were not
+          singular. Previously the <code class="computeroutput"><span class="identifier">is_singular</span></code>
+          member function always returned <code class="computeroutput"><span class="keyword">false</span></code>
+          in release build configurations, hence it is not anticipated that this
+          interface change will produce difficulty in upgrading.
+        </li></ol></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="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.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="upgrade_from_1_34.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>