Boost-Commit :

Date view	Thread view	Subject view	Author view

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

Next message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r62009 - website/public_html/live/doc"
Previous message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r62007 - website/public_html/live/doc"

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 1. Range 2.0</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="index.html" title="Chapter 1. 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 1. Range 2.0">
+<div class="titlepage"><div>
+<div><h2 class="title">
+<a name="range"></a>Chapter 1. Range 2.0</h2></div>
+<div><div class="author"><h3 class="author">
+Thorsten Ottosen
+</h3></div></div>
+<div><div class="author"><h3 class="author">
+Neil Groves
+</h3></div></div>
+<div>Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves</div>
+<div><div class="legalnotice" title="Legal Notice">
+<a name="id554184"></a>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></div>
+</div></div>
+<div class="toc">
+Table of Contents
+<dl>
+<dt>Introduction</dt>
+<dt> Range Concepts</dt>
+<dd><dl>
+<dt>Overview</dt>
+<dt>Single Pass Range</dt>
+<dt>Forward Range</dt>
+<dt>Bidirectional Range</dt>
+<dt>Random Access Range</dt>
+<dt>Concept Checking</dt>
+</dl></dd>
+<dt> Reference</dt>
+<dd><dl>
+<dt>Overview</dt>
+<dt><a href="range/reference/concept_implementation.html"> Range concept
+ implementation</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Semantics</dt>
+</dl></dd>
+<dt> Range Adaptors</dt>
+<dd><dl>
+<dt><a href="range/reference/adaptors/introduction.html"> Introduction
+ and motivation</a></dt>
+<dt><a href="range/reference/adaptors/general_requirements.html"> General
+ Requirements</a></dt>
+<dt> Reference</dt>
+</dl></dd>
+<dt> Range Algorithm</dt>
+<dd><dl>
+<dt><a href="range/reference/algorithms/range_algorithm_introduction.html">
+ Introduction and motivation</a></dt>
+<dt> Mutating algorithms</dt>
+<dt><a href="range/reference/algorithms/non_mutating.html"> Non-mutating
+ algorithms</a></dt>
+<dt> Set algorithms</dt>
+<dt> Heap algorithms</dt>
+<dt><a href="range/reference/algorithms/permutation.html"> Permutation
+ algorithms</a></dt>
+<dt> New algorithms</dt>
+<dt> Numeric algorithms</dt>
+</dl></dd>
+<dt> Provided Ranges</dt>
+<dd><dl>
+<dt> counting_range</dt>
+<dt> istream_range</dt>
+<dt> irange</dt>
+</dl></dd>
+<dt> Utilities</dt>
+<dd><dl>
+<dt> Class iterator_range</dt>
+<dt> Class sub_range</dt>
+<dt> Function join</dt>
+</dl></dd>
+<dt> Extending the library</dt>
+<dd><dl>
+<dt><a href="range/reference/extending/method_1.html"> Method 1: provide
+ member functions and nested types</a></dt>
+<dt><a href="range/reference/extending/method_2.html"> Method 2: provide
+ free-standing functions and specialize metafunctions</a></dt>
+<dt><a href="range/reference/extending/method_3.html"> Method 3: provide
+ range adaptor implementations</a></dt>
+</dl></dd>
+</dl></dd>
+<dt> Terminology and style guidelines</dt>
+<dt>Library Headers</dt>
+<dd><dl>
+<dt>General</dt>
+<dt>Adaptors</dt>
+<dt>Algorithm</dt>
+<dt><a href="range/library_headers/algorithm_extensions.html">Algorithm
+ Extensions</a></dt>
+</dl></dd>
+<dt>Examples</dt>
+<dt> MFC/ATL (courtesy of Shunsuke Sogame)</dt>
+<dd><dl>
+<dt> Requirements</dt>
+<dt> MFC Ranges</dt>
+<dt> ATL Ranges</dt>
+<dt> const Ranges</dt>
+<dt> References</dt>
+</dl></dd>
+<dt> Upgrade version of Boost.Range</dt>
+<dd><dl>
+<dt><a href="range/upgrade/upgrade_from_1_42.html"> Upgrade from version
+ 1.42</a></dt>
+<dt><a href="range/upgrade/upgrade_from_1_34.html"> Upgrade from version
+ 1.34</a></dt>
+</dl></dd>
+<dt>Portability</dt>
+<dt>FAQ</dt>
+<dt> History and Acknowledgement</dt>
+</dl>
+</div>
+
+ Boost.Range is a collection of concepts and utilities, range-based algorithms,
+ as well as range adaptors that allow for efficient and expressive code.
+ 
+
+ Using Boost.Range inplace of the standard library alternatives results in more
+ readable code and in many cases greater efficiency.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left">Last revised: May 15, 2010 at 19:03:38 GMT</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. 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>Overview</dt>
+<dt>Single Pass Range</dt>
+<dt>Forward Range</dt>
+<dt>Bidirectional Range</dt>
+<dt>Random Access Range</dt>
+<dt>Concept Checking</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ <code class="computeroutput">X</code>
+ 
+ </td>
+<td>
+ 
+ A type that is a model of <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">a</code>
+ 
+ </td>
+<td>
+ 
+ Object of type X.
+ 
+ </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>
+
+ This concept provides access to iterators that traverse in both directions
+ (forward and reverse). The <code class="computeroutput">boost::range_iterator<X>::type</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>.
+ 
+<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>
+
+ <a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
+ 
+<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>
+ 
+ Reverse Iterator type
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_reverse_iterator<X>::type</code>
+ 
+ </td>
+<td>
+ 
+ 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.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Const reverse iterator type
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_reverse_iterator<const X>::type</code>
+ 
+ </td>
+<td>
+ 
+ A type of reverse iterator that may be used to examine, but not
+ to modify, a Range's elements.
+ 
+ </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>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Return type
+ 
+ </th>
+<th>
+ 
+ Semantics
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Beginning of range
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::rbegin(a)</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_reverse_iterator<X>::type</code> if <code class="computeroutput">a</code>
+ is mutable <code class="computeroutput">boost::range_reverse_iterator<const
+ X>::type</code> otherwise.
+ 
+ </td>
+<td>
+ 
+ Equivalent to <code class="computeroutput">boost::range_reverse_iterator<X>::type(boost::end(a))</code>.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ End of range
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::rend(a)</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_reverse_iterator<X>::type</code> if <code class="computeroutput">a</code>
+ is mutable, <code class="computeroutput">boost::range_reverse_iterator<const
+ X>::type</code> otherwise.
+ 
+ </td>
+<td>
+ 
+ Equivalent to <code class="computeroutput">boost::range_reverse_iterator<X>::type(boost::begin(a))</code>.
+ 
+ </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>
+
+ <code class="computeroutput">boost::rbegin(a)</code> has
+ the same complexity as <code class="computeroutput">boost::end(a)</code> and
+ <code class="computeroutput">boost::rend(a)</code> has the same complexity as <code class="computeroutput">boost::begin(a)</code> from
+ <a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>.
+ 
+<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>
+ 
+ Valid reverse range
+ 
+ </td>
+<td>
+ 
+ For any Bidirectional Range a, <code class="computeroutput">[boost::rbegin(a),boost::rend(a))</code>
+ is a valid range, that is, <code class="computeroutput">boost::rend(a)</code> is reachable from <code class="computeroutput">boost::rbegin(a)</code>
+ in a finite number of increments.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Completeness
+ 
+ </td>
+<td>
+ 
+ An algorithm that iterates through the range <code class="computeroutput">[boost::rbegin(a),boost::rend(a))</code>
+ will pass through every element of <code class="computeroutput">a</code>.
+ 
+ </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>
+
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+ of metafunctions</a>
+ 
+
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+ of functions</a>
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="random_access_range.html" title="Random Access Range">
+<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>
+
+ 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">T</code> models the <a class="link" href="forward_range.html" title="Forward Range">Forward
+ Range</a> concept.
+ 
+
+
+
+<pre class="programlisting">BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<T> ));
+</pre>
+
+ 
+
+ 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.
+ 
+
+
+
+<pre class="programlisting">BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<T> ));
+BOOST_CONCEPT_ASSERT(( ReadableIteratorConcept<typename range_iterator<T>::type> ));
+</pre>
+
+ 
+
+ The following range concept checking classes are provided.
+ 
+<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>
+
+ <a class="link" href="../style_guide.html" title="Terminology and style guidelines">Range Terminology and style guidelines</a>
+ 
+
+ Iterator concepts
+ 
+
+ Boost Concept Check library
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../concepts.html" title="Range Concepts">
+<link rel="prev" href="single_pass_range.html" title="Single Pass Range">
+<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>
+ 
+ <code class="computeroutput">X</code>
+ 
+ </td>
+<td>
+ 
+ A type that is a model of <a class="link" href="forward_range.html" title="Forward Range">Forward
+ Range</a>.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">a</code>
+ 
+ </td>
+<td>
+ 
+ Object of type X.
+ 
+ </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>
+
+ A range <code class="computeroutput">X</code> where <code class="computeroutput">boost::range_iterator<X>::type</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>.
+ 
+<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>
+
+ <a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ 
+<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>
+ 
+ Distance type
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_difference<X>::type</code>
+ 
+ </td>
+<td>
+ 
+ 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.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Size type
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_size<X>::type</code>
+ 
+ </td>
+<td>
+ 
+ An unsigned integral type that can represent any nonnegative value
+ of the Range's distance type.
+ 
+ </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>
+
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+ of metafunctions</a>
+ 
+
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+ of functions</a>
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+ A Range is a concept
+ similar to the STL Container
+ concept. A Range provides iterators for accessing a half-open range <code class="computeroutput">[first,one_past_last)</code> of elements and provides information about
+ the number of elements in the Range. However, a Range has fewer requirements
+ than a Container.
+ 
+
+ 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
+ 
+<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>
+
+ Because of the second requirement, a Range object must be passed by (const
+ or non-const) reference in generic code.
+ 
+
+ 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.
+ 
+
+ The concepts described below specifies associated types as metafunctions
+ and all functions as free-standing functions to allow for a layer of indirection.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+ A range <code class="computeroutput">X</code> where <code class="computeroutput">boost::range_iterator<X>::type</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>.
+ 
+<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>
+
+ <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
+ 
+<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>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Return type
+ 
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ 
+ Size of range
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::size(a)</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_size<X>::type</code>
+ 
+ </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>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Semantics
+ 
+ </th>
+<th>
+ 
+ Postcondition
+ 
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ 
+ <code class="computeroutput">boost::size(a)</code>
+ 
+ </td>
+<td>
+ 
+ Returns the size of the Range, that is, its number of elements.
+ Note <code class="computeroutput">boost::size(a)
+ == 0u</code>
+ is equivalent to <code class="computeroutput">boost::empty(a)</code>.
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::size(a)
+ >= 0</code>
+ 
+ </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>
+
+ <code class="computeroutput">boost::size(a)</code> completes in amortized constant time.
+ 
+<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>
+ 
+ Range size
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::size(a)</code>
+ is equal to the <code class="computeroutput">boost::end(a)</code> - <code class="computeroutput">boost::begin(a)</code>.
+ 
+ </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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ <code class="computeroutput">X</code>
+ 
+ </td>
+<td>
+ 
+ A type that is a model of <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">a</code>
+ 
+ </td>
+<td>
+ 
+ Object of type X.
+ 
+ </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>
+
+ A range <code class="computeroutput">X</code> where <code class="computeroutput">boost::range_iterator<X>::type</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>.
+ 
+<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>
+ 
+ Iterator type
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_iterator<X>::type</code>
+ 
+ </td>
+<td>
+ 
+ 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">const</code>
+ iterator type must exist.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Const iterator type
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_iterator<const X>::type</code>
+ 
+ </td>
+<td>
+ 
+ A type of iterator that may be used to examine, but not to modify,
+ a Range's elements.
+ 
+ </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>
+
+ The following expressions must be valid.
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Return type
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Beginning of range
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::begin(a)</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_iterator<X>::type</code> if <code class="computeroutput">a</code>
+ is mutable, <code class="computeroutput">boost::range_iterator<const
+ X>::type</code> otherwise
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ End of range
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::end(a)</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::range_iterator<X>::type</code> if <code class="computeroutput">a</code>
+ is mutable, <code class="computeroutput">boost::range_iterator<const
+ X>::type</code> otherwise
+ 
+ </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>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Semantics
+ 
+ </th>
+<th>
+ 
+ Postcondition
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">boost::begin(a)</code>
+ 
+ </td>
+<td>
+ 
+ Returns an iterator pointing to the first element in the Range.
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::begin(a)</code>
+ is either dereferenceable or past-the-end. It is past-the-end if
+ and only if <code class="computeroutput">boost::distance(a) == 0</code>.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">boost::end(a)</code>
+ 
+ </td>
+<td>
+ 
+ Returns an iterator pointing one past the last element in the Range.
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::end(a)</code>
+ is past-the-end.
+ 
+ </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>
+
+ <code class="computeroutput">boost::end(a)</code> is at most amortized linear time, <code class="computeroutput">boost::begin(a)</code> is amortized
+ constant time. For most practical purposes, one can expect both to be amortized
+ constant time.
+ 
+<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>
+ 
+ Valid range
+ 
+ </td>
+<td>
+ 
+ For any Range <code class="computeroutput">a</code>,
+ <code class="computeroutput">[boost::begin(a),boost::end(a))</code> is a valid range, that is, <code class="computeroutput">boost::end(a)</code>
+ is reachable from <code class="computeroutput">boost::begin(a)</code> in a finite number of increments.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Completeness
+ 
+ </td>
+<td>
+ 
+ An algorithm that iterates through the range <code class="computeroutput">[boost::begin(a),boost::end(a))</code>
+ will pass through every element of <code class="computeroutput">a</code>.
+ 
+ </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>
+
+ <a class="link" href="../reference/extending.html" title="Extending the library">Extending the library for UDTs</a>
+ 
+
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+ of metafunctions</a>
+ 
+
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+ of functions</a>
+ 
+
+ Container
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Range 2.0">
+<link rel="prev" href="library_headers/algorithm_extensions.html" title="Algorithm Extensions">
+<link rel="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>
+
+ Some examples are given in the accompanying test files:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+string.cpp
+ shows how to implement a container version of <code class="computeroutput">std::find()</code> that works with <code class="computeroutput">char[]</code>,<code class="computeroutput">wchar_t[]</code>,<code class="computeroutput">char*</code>,<code class="computeroutput">wchar_t*</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. 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>
+
+ 1. Why is there no difference between <code class="computeroutput">range_iterator<C>::type</code>
+ and <code class="computeroutput">range_const_iterator<C>::type</code>
+ for <code class="computeroutput">std::pair<iterator, iterator></code>?
+ 
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ In general it is not possible nor desirable to find a corresponding <code class="computeroutput">const_iterator</code>. When it is possible to
+ come up with one, the client might choose to construct a <code class="computeroutput">std::pair<const_iterator,const_iterator></code>
+ object.
+ 
+
+ 
+</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ Note that an <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput">iterator_range</code></a> is somewhat more
+ convenient than a <code class="computeroutput">pair</code>
+ and that a <a class="link" href="reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput">sub_range</code></a> does propagate const-ness.
+ 
+
+ 
+</blockquote></div>
+
+ 2. Why is there not supplied more types or
+ more functions?
+ 
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ 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.
+ 
+
+ 
+</blockquote></div>
+
+ 3. How should I implement generic algorithms
+ for ranges?
+ 
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ 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.
+ 
+
+ 
+</blockquote></div>
+
+ 4. Why is there no Incrementable Range concept?
+ 
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ 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.
+ 
+
+ 
+</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ Note also that incrementable iterators are derived from output iterators
+ and so there exist no output range.
+ 
+
+ 
+</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. 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>
+
+ The library have been under way for a long time. Dietmar Kühl originally intended
+ to submit an <code class="computeroutput">array_traits</code> class
+ template which had most of the functionality present now, but only for arrays
+ and standard containers.
+ 
+
+ Meanwhile work on algorithms for containers in various contexts showed the
+ need for handling pairs of iterators, and string libraries needed special treatment
+ of character arrays. In the end it made sense to formalize the minimal requirements
+ of these similar concepts. And the results are the Range concepts found in
+ this library.
+ 
+
+ The term Range was adopted because of paragraph 24.1/7 from the C++ standard:
+ 
+
+ Most of the library's algorithmic templates that operate on data structures
+ have interfaces that use ranges. A range is a pair of iterators that designate
+ the beginning and end of the computation. A range [i, i) is an empty range;
+ in general, a range [i, j) refers to the elements in the data structure starting
+ with the one pointed to by i and up to but not including the one pointed to
+ by j. Range [i, j) is valid if and only if j is reachable from i. The result
+ of the application of functions in the library to invalid ranges is undefined.
+ 
+
+ Special thanks goes to
+ 
+<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>
+
+ The concept checks and their documentation was provided by Daniel Walker.
+ 
+<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>
+
+ This version introduced Range Adaptors and Range Algorithms. This version 2
+ is the result of a merge of all of the RangeEx features into Boost.Range.
+ 
+
+ There were an enormous number of very significant contributors through all
+ stages of this library.
+ 
+
+ The people in the following list all made contributions in the form of reviews,
+ user feedback, design suggestions, or defect detection:
+ 
+<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>
+
+ 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.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Range 2.0">
+<link rel="prev" href="../index.html" title="Chapter 1. Range 2.0">
+<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>
+
+ 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.
+ 
+
+ 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 if a
+ suitable layer of indirection is applied . 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.
+ 
+
+ This library therefore provides the means to adapt standard-like containers,
+ null terminated strings, <code class="computeroutput">std::pairs</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.
+ 
+
+ The main advantages are
+ 
+<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>
+
+ Below are given a small example (the complete example can be found here
+ ):
+ 
+
+
+
+<pre class="programlisting">//
+// example: extracting bounds in a generic algorithm
+//
+template< class ForwardReadableRange, class T >
+inline typename boost::range_iterator< ForwardReadableRange >::type
+find( ForwardReadableRange& c, const T& value )
+{
+ return std::find( boost::begin( c ), boost::end( c ), value );
+}
+
+template< class ForwardReadableRange, class T >
+inline typename boost::range_iterator< const ForwardReadableRange >::type
+find( const ForwardReadableRange& c, const T& value )
+{
+ return std::find( boost::begin( c ), boost::end( c ), value );
+}
+
+//
+// replace first value and return its index
+//
+template< class ForwardReadableWriteableRange, class T >
+inline typename boost::range_size< ForwardReadableWriteableRange >::type
+my_generic_replace( ForwardReadableWriteableRange& c, const T& value, const T& replacement )
+{
+ typename boost::range_iterator< ForwardReadableWriteableRange >::type found = find( c, value );
+
+ if( found != boost::end( c ) )
+ *found = replacement;
+ return std::distance( boost::begin( c ), found );
+}
+
+//
+// usage
+//
+const int N = 5;
+std::vector<int> my_vector;
+int values[] = { 1,2,3,4,5,6,7,8,9 };
+
+my_vector.assign( values, boost::end( values ) );
+typedef std::vector<int>::iterator iterator;
+std::pair<iterator,iterator> my_view( boost::begin( my_vector ),
+ boost::begin( my_vector ) + N );
+char str_val[] = "a string";
+char* str = str_val;
+
+std::cout << my_generic_replace( my_vector, 4, 2 );
+std::cout << my_generic_replace( my_view, 4, 2 );
+std::cout << my_generic_replace( str, 'a', 'b' );
+
+// prints '3', '5' and '0'
+</pre>
+
+ 
+
+ 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">find()</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> ).
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Range 2.0">
+<link rel="prev" href="style_guide.html" title="Terminology and style guidelines">
+<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>General</dt>
+<dt>Adaptors</dt>
+<dt>Algorithm</dt>
+<dt><a href="library_headers/algorithm_extensions.html">Algorithm
+ Extensions</a></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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ Header
+ 
+ </th>
+<th>
+ 
+ Includes
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/adjacent_filtered.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/copied.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/copied.html" title="copied">copied</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/filtered.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/filtered.html" title="filtered">filtered</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/indexed.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/indexed.html" title="indexed">indexed</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/indirected.hpp.</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/indirected.html" title="indirected">indirected</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/map.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <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>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/replaced.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/replaced.html" title="replaced">replaced</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/replaced_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/replaced_if.html" title="replaced_if">replaced_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/reversed.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/reversed.html" title="reversed">reversed</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/sliced.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/sliced.html" title="sliced">sliced</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/strided.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/strided.html" title="strided">strided</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/tokenized.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/tokenized.html" title="tokenized">tokenized</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/transformed.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/transformed.html" title="transformed">transformed</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptor/uniqued.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/adaptors/reference/uniqued.html" title="uniqued">uniqued</a>
+ 
+ </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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ Header
+ 
+ </th>
+<th>
+ 
+ Includes
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/adjacent_find.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/adjacent_find.html" title="adjacent_find">adjacent_find</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/binary_search.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/binary_search.html" title="binary_search">binary_search</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/copy.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/copy.html" title="copy">copy</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/copy_backward.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/copy_backward.html" title="copy_backward">copy_backward</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/count.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/count.html" title="count">count</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/count_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/count_if.html" title="count_if">count_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/equal.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/equal.html" title="equal">equal</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/equal_range.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/equal_range.html" title="equal_range">equal_range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/fill.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/fill.html" title="fill">fill</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/fill_n.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/fill_n.html" title="fill_n">fill_n</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/find.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/find.html" title="find">find</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/find_end.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/find_end.html" title="find_end">find_end</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/find_first_of.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/find_first_of.html" title="find_first_of">find_first_of</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/find_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/find_if.html" title="find_if">find_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/for_each.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/for_each.html" title="for_each">for_each</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/generate.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/generate.html" title="generate">generate</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/heap_algorithm.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <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>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/inplace_merge.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/inplace_merge.html" title="inplace_merge">inplace_merge</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/lexicographical_compare.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/lower_bound.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/lower_bound.html" title="lower_bound">lower_bound</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/max_element.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/max_element.html" title="max_element">max_element</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/merge.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/merge.html" title="merge">merge</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/min_element.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/min_element.html" title="min_element">min_element</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/mismatch.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/mismatch.html" title="mismatch">mismatch</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/nth_element.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/nth_element.html" title="nth_element">nth_element</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/partial_sort.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/partial_sort.html" title="partial_sort">partial_sort</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/partition.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/partition.html" title="partition">partition</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/permutation.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <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>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/random_shuffle.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/random_shuffle.html" title="random_shuffle">random_shuffle</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/remove.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/remove.html" title="remove">remove</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/remove_copy.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/remove_copy.html" title="remove_copy">remove_copy</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/remove_copy_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/remove_copy_if.html" title="remove_copy_if">remove_copy_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/remove_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/remove_if.html" title="remove_if">remove_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/replace.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/replace.html" title="replace">replace</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/replace_copy.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/replace_copy.html" title="replace_copy">replace_copy</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/replace_copy_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/replace_copy_if.html" title="replace_copy_if">replace_copy_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/replace_if.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/replace_if.html" title="replace_if">replace_if</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/reverse.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/reverse.html" title="reverse">reverse</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/reverse_copy.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/reverse_copy.html" title="reverse_copy">reverse_copy</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/rotate.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/rotate.html" title="rotate">rotate</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/rotate_copy.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/rotate_copy.html" title="rotate_copy">rotate_copy</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/search.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/search.html" title="search">search</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/search_n.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/search_n.html" title="search_n">search_n</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/set_algorithm.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <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>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/sort.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/sort.html" title="sort">sort</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/stable_partition.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/stable_partition.html" title="stable_partition">stable_partition</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/swap_ranges.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/swap_ranges.html" title="swap_ranges">swap_ranges</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/transform.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/transform.html" title="transform">transform</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/unique.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/unique.html" title="unique">unique</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/unique_copy.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/mutating/unique_copy.html" title="unique_copy">unique_copy</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm/upper_bound.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/non_mutating/upper_bound.html" title="upper_bound">upper_bound</a>
+ 
+ </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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ Header
+ 
+ </th>
+<th>
+ 
+ Includes
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/copy_n.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/copy_n.html" title="copy_n">copy_n</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/erase.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/erase.html" title="erase">erase</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/for_each.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/for_each.html" title="for_each">for_each</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/insert.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/insert.html" title="insert">insert</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/iota.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/iota.html" title="iota">iota</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/is_sorted.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/is_sorted.html" title="is_sorted">is_sorted</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/overwrite.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/overwrite.html" title="overwrite">overwrite</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/push_back.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/push_back.html" title="push_back">push_back</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext/push_front.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/algorithms/new/push_front.html" title="push_front">push_front</a>
+ 
+ </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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ Header
+ 
+ </th>
+<th>
+ 
+ Includes
+ 
+ </th>
+<th>
+ 
+ Related Concept
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range.hpp></code>
+ 
+ </td>
+<td>
+ 
+ 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.
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/metafunctions.hpp></code>
+ 
+ </td>
+<td>
+ 
+ every metafunction
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/functions.hpp></code>
+ 
+ </td>
+<td>
+ 
+ every function
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/value_type.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput">range_value</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/iterator.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput">range_iterator</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/difference_type.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput">range_difference</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/pointer.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput">range_pointer</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/category.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput">range_category</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/reverse_iterator.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput">range_reverse_iterator</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/begin.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">begin</code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">const_begin</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/end.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">end</code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">const_end</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/empty.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">empty</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/distance.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">distance</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/size.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">size</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/rbegin.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">rbegin</code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">const_rbegin</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/rend.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">rend</code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">const_rend</code></a>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/as_array.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">as_array</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/as_literal.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">as_literal</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/iterator_range.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput">iterator_range</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/sub_range.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput">sub_range</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/concepts.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts.html" title="Range Concepts">Range concepts</a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/adaptors.hpp></code>
+ 
+ </td>
+<td>
+ 
+ every range adaptor
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm.hpp></code>
+ 
+ </td>
+<td>
+ 
+ every range equivalent of an STL algorithm
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/algorithm_ext.hpp></code>
+ 
+ </td>
+<td>
+ 
+ every range algorithm that is an extension of the STL algorithms
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/counting_range.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/ranges/counting_range.html" title="counting_range"><code class="computeroutput">counting_range</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/istream_range.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/ranges/istream_range.html" title="istream_range"><code class="computeroutput">istream_range</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/irange.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/ranges/irange.html" title="irange"><code class="computeroutput">irange</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput"><boost/range/join.hpp></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../reference/utilities/join.html" title="Function join"><code class="computeroutput">join</code></a>
+ 
+ </td>
+<td>
+ 
+ -
+ 
+ </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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. 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> Requirements</dt>
+<dt> MFC Ranges</dt>
+<dt> ATL Ranges</dt>
+<dt> const Ranges</dt>
+<dt> References</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>
+
+ This implementation was kindly donated by Shunsuke Sogame. This header adapts
+ MFC and ATL containers to the appropriate Range concepts.
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr></tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Author:
+ 
+ </td>
+<td>
+ 
+ Shunsuke Sogame
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Contact:
+ 
+ </td>
+<td>
+ 
+ mb2act_at_[hidden]
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Date:
+ 
+ </td>
+<td>
+ 
+ 26th of May 2006
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Copyright:
+ 
+ </td>
+<td>
+ 
+ Shunsuke Sogame 2005-2006. Use, modification and distribution is
+ subject to the Boost Software License, Version 1.0
+ 
+ </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>
+
+ Boost.Range MFC/ATL Extension provides Boost.Range support for MFC/ATL collection
+ and string types.
+ 
+
+
+
+<pre class="programlisting">CTypedPtrArray<CPtrArray, CList<CString> *> myArray;
+...
+BOOST_FOREACH (CList<CString> *theList, myArray)
+{
+ BOOST_FOREACH (CString& str, *theList)
+ {
+ boost::to_upper(str);
+ std::sort(boost::begin(str), boost::end(str));
+ ...
+ }
+}
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
+<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>
+
+ If the <code class="computeroutput"><boost/range/atl.hpp></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">range_reference</code> of ATL
+ ranges.
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Range
+ 
+ </th>
+<th>
+ 
+ Traversal Category
+ 
+ </th>
+<th>
+ 
+ <code class="computeroutput">range_reference<Range>::type</code>
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CAtlArray<E,ET></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">E&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CAutoPtrArray<E></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">E&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CInterfaceArray<I,pi></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">CComQIPtr<I,pi>&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CAtlList<E,ET></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">E&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CAutoPtrList<E></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">E&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CHeapPtrList<E,A></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">E&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CInterfaceList<I,pi></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">CComQIPtr<I,pi>&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CAtlMap<K,V,KT,VT></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Range::CPair&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CRBTree<K,V,KT,VT></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Range::CPair&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CRBMap<K,V,KT,VT></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Range::CPair&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CRBMultiMap<K,V,KT,VT></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Range::CPair&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CSimpleStringT<B,b></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">B&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CStringT<B,ST></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">B&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CFixedStringT<S,n></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">range_reference<S>::type</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CComBSTR</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">OLECHAR&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CSimpleArray<T,TE></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">T&</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+
+ Other <a class="link" href="../../index.html" title="Chapter 1. Range 2.0">Boost.Range</a> metafunctions are defined
+ by the following. Let <code class="computeroutput">Range</code>
+ be any type listed above and <code class="computeroutput">Ref</code>
+ be the same as <code class="computeroutput">range_reference<Range>::type</code>.
+ <code class="computeroutput">range_value<Range>::type</code> is the same as <code class="computeroutput">remove_reference<Ref>::type</code>,
+ <code class="computeroutput">range_difference<Range>::type</code> is the same as <code class="computeroutput">std::ptrdiff_t</code>,
+ and <code class="computeroutput">range_pointer<Range>::type</code> is the same as <code class="computeroutput">add_pointer<remove_reference<Ref>::type>::type</code>.
+ As for <code class="computeroutput">const Range</code>,
+ see below.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="atl_ranges.html" title="ATL Ranges">
+<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>
+
+ <code class="computeroutput">range_reference<const Range>::type</code>
+ is defined by the following algorithm. Let <code class="computeroutput">Range</code>
+ be any type listed above and <code class="computeroutput">Ref</code>
+ be the same as <code class="computeroutput">range_reference<Range>::type</code>.
+ 
+
+
+
+<pre class="programlisting">if (Range is CObArray || Range is CObList)
+ return CObject const * &
+else if (Range is CPtrArray || Range is CPtrList)
+ return void const * &
+else if (there is a type X such that X& is the same as Ref)
+ return X const &
+else if (there is a type X such that X* const is the same as Ref)
+ return X const * const
+else
+ return Ref
+</pre>
+
+ 
+
+ Other Boost.Range metafunctions are defined by the following.
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Range metafunction
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">range_value<const Range>::type</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">range_value<Range>::type</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">range_difference<const
+ Range>::type</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::ptrdiff_t</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">range_pointer<const Range>::type</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">add_pointer<remove_reference<range_reference<const Range>::type>::type>::type</code>
+ 
+ </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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="requirements.html" title="Requirements">
+<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>
+
+ If the <code class="computeroutput"><boost/range/mfc.hpp></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">range_reference</code> of MFC
+ ranges.
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Range
+ 
+ </th>
+<th>
+ 
+ Traversal Category
+ 
+ </th>
+<th>
+ 
+ <code class="computeroutput">range_reference<Range>::type</code>
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CArray<T,A></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">T&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CList<T,A></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">T&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMap<K,AK,M,AM></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Range::CPair&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CTypedPtrArray<B,T*></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">T*
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CTypedPtrList<B,T*></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">T*
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CTypedPtrMap<B,T*,V*></code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::pair<T*,V*>
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CByteArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">BYTE&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CDWordArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">DWORD&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CObArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">CObject*&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CPtrArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">void*&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CStringArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">CString&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CUIntArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">UINT&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CWordArray</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">WORD&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CObList</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">CObject*&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CPtrList</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">void*&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CStringList</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">CString&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMapPtrToWord</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::pair<void*,WORD>
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMapPtrToPtr</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::pair<void*,void*>
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMapStringToOb</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::pair<String,CObject*>
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMapStringToString</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Range::CPair&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMapWordToOb</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::pair<WORD,CObject*>
+ const</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">CMapWordToPtr</code>
+ 
+ </td>
+<td>
+ 
+ <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">std::pair<WORD,void*>
+ const</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+
+ Other Boost.Range metafunctions are defined by the following. Let <code class="computeroutput">Range</code> be any type listed above and <code class="computeroutput">Ref</code> be the same as <code class="computeroutput">range_reference<Range>::type</code>.
+ <code class="computeroutput">range_value<Range>::type</code> is the same as <code class="computeroutput">remove_reference<remove_const<Ref>::type>::type</code>,
+ <code class="computeroutput">range_difference<Range>::type</code> is the same as <code class="computeroutput">std::ptrdiff_t</code>,
+ and <code class="computeroutput">range_pointer<Range>::type</code> is the same as <code class="computeroutput">add_pointer<remove_reference<Ref>::type>::type</code>.
+ As for <code class="computeroutput">const Range</code>,
+ see below.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="const_ranges.html" title="const Ranges">
+<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 1. 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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Range 2.0">
+<link rel="prev" href="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
+<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>
+
+ A huge effort has been made to port the library to as many compilers as possible.
+ 
+
+ 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.
+ 
+
+ 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">range_iterator</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.
+ 
+
+ For maximum portability you should follow these guidelines:
+ 
+<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">begin</code></a><code class="computeroutput">()</code>,
+ <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">end</code></a><code class="computeroutput">()</code>
+ and <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput">iterator_range</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">const_begin</code></a><code class="computeroutput">()</code>
+ and <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput">const_end</code></a><code class="computeroutput">()</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Range 2.0">
+<link rel="prev" href="concepts/concept_checking.html" title="Concept Checking">
+<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>Overview</dt>
+<dt><a href="reference/concept_implementation.html"> Range concept
+ implementation</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Semantics</dt>
+</dl></dd>
+<dt> Range Adaptors</dt>
+<dd><dl>
+<dt><a href="reference/adaptors/introduction.html"> Introduction
+ and motivation</a></dt>
+<dt><a href="reference/adaptors/general_requirements.html"> General
+ Requirements</a></dt>
+<dt> Reference</dt>
+</dl></dd>
+<dt> Range Algorithm</dt>
+<dd><dl>
+<dt><a href="reference/algorithms/range_algorithm_introduction.html">
+ Introduction and motivation</a></dt>
+<dt> Mutating algorithms</dt>
+<dt><a href="reference/algorithms/non_mutating.html"> Non-mutating
+ algorithms</a></dt>
+<dt> Set algorithms</dt>
+<dt> Heap algorithms</dt>
+<dt><a href="reference/algorithms/permutation.html"> Permutation
+ algorithms</a></dt>
+<dt> New algorithms</dt>
+<dt> Numeric algorithms</dt>
+</dl></dd>
+<dt> Provided Ranges</dt>
+<dd><dl>
+<dt> counting_range</dt>
+<dt> istream_range</dt>
+<dt> irange</dt>
+</dl></dd>
+<dt> Utilities</dt>
+<dd><dl>
+<dt> Class iterator_range</dt>
+<dt> Class sub_range</dt>
+<dt> Function join</dt>
+</dl></dd>
+<dt> Extending the library</dt>
+<dd><dl>
+<dt><a href="reference/extending/method_1.html"> Method 1: provide
+ member functions and nested types</a></dt>
+<dt><a href="reference/extending/method_2.html"> Method 2: provide
+ free-standing functions and specialize metafunctions</a></dt>
+<dt><a href="reference/extending/method_3.html"> Method 3: provide
+ range adaptor implementations</a></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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="adaptors/introduction.html"> Introduction
+ and motivation</a></dt>
+<dt><a href="adaptors/general_requirements.html"> General
+ Requirements</a></dt>
+<dt> Reference</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+ In the description of generator expressions, the following notation is
+ used:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">fwdRng</code> is an expression
+ of a type <code class="computeroutput">R</code> that models
+ <code class="computeroutput">ForwardRange</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">biRng</code> is an expression
+ of a type <code class="computeroutput">R</code> that models
+ <code class="computeroutput">BidirectionalRange</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">rndRng</code> is an expression
+ of a type <code class="computeroutput">R</code> that models
+ <code class="computeroutput">RandomAccessRange</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">pred</code> is an expression
+ of a type that models <code class="computeroutput">UnaryPredicate</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">bi_pred</code> is an expression
+ of a type that models <code class="computeroutput">BinaryPredicate</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">fun</code> is an expression
+ of a type that models <code class="computeroutput">UnaryFunction</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">value</code>, <code class="computeroutput">new_value</code> and <code class="computeroutput">old_value</code>
+ are objects convertible to <code class="computeroutput">boost::range_value<R>::type</code>
+</li>
+<li class="listitem">
+<code class="computeroutput">n,m</code> are integer expressions convertible
+ to <code class="computeroutput">range_difference<R>::type</code>
+</li>
+</ul></div>
+
+ Also note that <code class="computeroutput">boost::range_value<R>::type</code> must be implicitly convertible to
+ the type arguments to <code class="computeroutput">pred</code>,
+ <code class="computeroutput">bi_pred</code> and <code class="computeroutput">fun</code>.
+ 
+
+ 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.
+ 
+
+ 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">filtered</code>
+ adaptor returns only a <code class="computeroutput">ForwardRange</code>
+ regardless of the input.
+ 
+
+ Furthermore, the following rules apply to any expression of the form
+
+<pre class="programlisting">rng | boost::adaptors::adaptor_generator
+</pre>
+
+ 
+
+ 1. Applying <code class="computeroutput">operator|()</code>
+ to a range <code class="computeroutput">R</code> (always left
+ argument) and a range adapter <code class="computeroutput">RA</code>
+ (always right argument) yields a new range type which may not conform to
+ the same range concept as <code class="computeroutput">R</code>.
+ 
+
+ 2. The return-type of <code class="computeroutput">operator|()</code> is otherwise unspecified.
+ 
+
+ 3. <code class="computeroutput">operator|()</code>
+ is found by Argument Dependent Lookup (ADL) because a range adaptor is
+ implemented in namespace <code class="computeroutput">boost::adaptors</code>.
+ 
+
+ 4. <code class="computeroutput">operator|()</code>
+ is used to add new behaviour lazily
+ and never modifies its left argument.
+ 
+
+ 5. All iterators extracted from the left argument are extracted using qualified
+ calls to <code class="computeroutput">boost::begin()</code>
+ and <code class="computeroutput">boost::end()</code>.
+ 
+
+ 6. In addition to the <code class="computeroutput">throw</code>-clauses
+ below, <code class="computeroutput">operator|()</code>
+ may throw exceptions as a result of copying iterators. If such copying
+ cannot throw an exception, then neither can the whole expression.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+ A Range Adaptor is a class that wraps
+ an existing Range to provide a new Range with different behaviour. Since
+ the behaviour of Ranges is determined by their associated iterators, a
+ Range Adaptor simply wraps the underlying iterators with new special iterators.
+ In this example
+ 
+
+
+
+<pre class="programlisting">#include <boost/range/adaptors.hpp>
+#include <boost/range/algorithm.hpp>
+#include <iostream>
+#include <vector>
+
+std::vector<int> vec;
+boost::copy( vec | boost::adaptors::reversed,
+ std::ostream_iterator<int>(std::cout) );
+</pre>
+
+ 
+
+ the iterators from <code class="computeroutput">vec</code>
+ are wrapped <code class="computeroutput">reverse_iterator</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
+ 
+
+
+
+<pre class="programlisting">vec | boost::adaptors::reversed
+</pre>
+
+ 
+
+ returns a Range Adaptor where the iterator type is now the iterator type
+ of the range <code class="computeroutput">vec</code> wrapped
+ in <code class="computeroutput">reverse_iterator</code>. The
+ expression <code class="computeroutput">boost::adaptors::reversed</code> is called an Adaptor
+ Generator.
+ 
+
+ There are two ways of constructing a range adaptor. The first is by using
+ <code class="computeroutput">operator|()</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">rng |
+ reversed</code> is <code class="computeroutput">adaptors::reverse(rng)</code> for example.
+ 
+
+ Why do I prefer the <code class="computeroutput">operator|</code> syntax? The answer is readability:
+ 
+
+
+
+<pre class="programlisting">std::vector<int> vec;
+boost::copy( boost::adaptors::reverse(vec),
+ std::ostream_iterator<int>(std::cout) );
+</pre>
+
+ 
+
+ This might not look so bad, but when we apply several adaptors, it becomes
+ much worse. Just compare
+ 
+
+
+
+<pre class="programlisting">std::vector<int> vec;
+boost::copy( boost::adaptors::unique( boost::adaptors::reverse( vec ) ),
+ std::ostream_iterator<int>(std::cout) );
+</pre>
+
+ 
+
+ to
+ 
+
+
+
+<pre class="programlisting">std::vector<int> vec;
+boost::copy( vec | boost::adaptors::reversed
+ | boost::adaptors::uniqued,
+ std::ostream_iterator<int>(std::cout) );
+</pre>
+
+ 
+
+ 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">operator|()</code>.
+ 
+<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>
+
+ Range Adaptors are a powerful complement to Range algorithms. The reason
+ is that adaptors are orthogonal
+ to algorithms. For example, consider these Range algorithms:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput">boost::copy( rng, out )</code></li>
+<li class="listitem"><code class="computeroutput">boost::count( rng, pred )</code></li>
+</ul></div>
+
+ What should we do if we only want to copy an element <code class="computeroutput">a</code>
+ if it satisfies some predicate, say <code class="computeroutput">pred(a)</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:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem"><code class="computeroutput">boost::copy_if(
+ rng,
+ pred,
+ out )</code></li>
+<li class="listitem"><code class="computeroutput">boost::count_if(
+ rng,
+ pred )</code></li>
+</ul></div>
+
+ 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">_if</code> variants and there
+ is redundant development overhead for each new algorithm. The Adaptor Generator
+ is the design solution to this problem.
+ 
+<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>
+
+
+
+<pre class="programlisting">boost::copy_if( rng, pred, out );
+</pre>
+
+ can be expressed as
+
+<pre class="programlisting">boost::copy( rng | boost::adaptors::filtered(pred), out );
+</pre>
+
+ 
+<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>
+
+
+
+<pre class="programlisting">boost::count_if( rng, pred );
+</pre>
+
+ can be expressed as
+
+<pre class="programlisting">boost::count( rng | boost::adaptors::filtered(pred), out );
+</pre>
+
+ 
+
+ What this means is that no
+ algorithm with the <code class="computeroutput">_if</code>
+ suffix is needed. Furthermore, it turns out that algorithms with the <code class="computeroutput">_copy</code> suffix are not needed either. Consider
+ the somewhat misdesigned <code class="computeroutput">replace_copy_if()</code> which may be used as
+ 
+
+
+
+<pre class="programlisting">std::vector<int> vec;
+boost::replace_copy_if( rng, std::back_inserter(vec), pred );
+</pre>
+
+ 
+
+ With adaptors and algorithms we can express this as
+ 
+
+
+
+<pre class="programlisting">std::vector<int> vec;
+boost::push_back(vec, rng | boost::adaptors::replaced_if(pred, new_value));
+</pre>
+
+ 
+
+ The latter code has several benefits:
+ 
+
+ 1. it is more efficient
+ because we avoid extra allocations as might happen with <code class="computeroutput">std::back_inserter</code>
+ 
+
+ 2. it is flexible
+ as we can subsequently apply even more adaptors, for example:
+
+<pre class="programlisting">boost::push_back(vec, rng | boost::adaptors::replaced_if(pred, new_value)
+ | boost::adaptors::reversed);
+</pre>
+
+ 
+
+ 3. it is safer because
+ there is no use of an unbounded output iterator.
+ 
+
+ In this manner, the composition
+ of Range Adaptors has the following consequences:
+ 
+
+ 1. we no longer need <code class="computeroutput">_if</code>,
+ <code class="computeroutput">_copy</code>, <code class="computeroutput">_copy_if</code>
+ and <code class="computeroutput">_n</code> variants of algorithms.
+ 
+
+ 2. we can generate a multitude of new algorithms on the fly, for example,
+ above we generated <code class="computeroutput">reverse_replace_copy_if()</code>
+ 
+
+ In other words:
+ 
+
+ Range Adaptors are to algorithms what algorithms
+ are to containers
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="reference/adjacent_filtered.html">
+ adjacent_filtered</a></dt>
+<dt> copied</dt>
+<dt> filtered</dt>
+<dt> indexed</dt>
+<dt> indirected</dt>
+<dt> map_keys</dt>
+<dt> map_values</dt>
+<dt> replaced</dt>
+<dt><a href="reference/replaced_if.html">
+ replaced_if</a></dt>
+<dt> reversed</dt>
+<dt> sliced</dt>
+<dt> strided</dt>
+<dt> tokenized</dt>
+<dt><a href="reference/transformed.html">
+ transformed</a></dt>
+<dt> uniqued</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example">
+ adjacent_filtered example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::adjacent_filtered(bi_pred)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::adjacent_filter(rng,
+ bi_pred)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range is convertible to both argument types of <code class="computeroutput">bi_pred</code>.
+ </li>
+<li class="listitem">
+Postcondition: For all adjacent elements
+ <code class="computeroutput">[x,y]</code> in the returned range, <code class="computeroutput">bi_pred(x,y)</code>
+ is <code class="computeroutput">true</code>.
+ </li>
+<li class="listitem">
+Throws: Whatever the copy constructor
+ of <code class="computeroutput">bi_pred</code> might throw.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The minimum
+ of the range category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/adjacent_filtered.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <functional>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,1,2,2,2,3,4,5,6;
+
+ boost::copy(
+ input | adjacent_filtered(std::not_equal_to<int>()),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">1,2,3,4,5,6
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="copied.html#range.reference.adaptors.reference.copied.copied_example">
+ copied example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::copied(n,
+ m)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::copy(rng,
+ n,
+ m)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition:<code class="computeroutput">0
+ <= n
+ && n
+ <= m
+ && m
+ < distance(rng)</code>
+</li>
+<li class="listitem">
+Returns: A new <code class="computeroutput">iterator_range</code>
+ that holds the sliced range <code class="computeroutput">[n,m)</code>
+ of the original range.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+ Access Range</a>
+</li>
+<li class="listitem">
+Returned Range Category:<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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/copied.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9,10;
+
+ boost::copy(
+ input | copied(1, 5),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">2,3,4,5
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example">
+ filtered example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::filtered(pred)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::filter(rng,
+ pred)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range is convertible to the argument type of <code class="computeroutput">pred</code>.
+ </li>
+<li class="listitem">
+Postcondition: For all adjacent elements
+ <code class="computeroutput">[x]</code> in the returned range, <code class="computeroutput">pred(x)</code>
+ is <code class="computeroutput">true</code>.
+ </li>
+<li class="listitem">
+Throws: Whatever the copy constructor
+ of <code class="computeroutput">pred</code> might throw.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+ Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The minimum
+ of the range category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/filtered.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+struct is_even
+{
+ bool operator()( int x ) const { return x % 2 == 0; }
+};
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | filtered(is_even()),
+ std::ostream_iterator<int>(std::cout, ","));
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">2,4,6,8
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example">
+ indexed example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::indexed</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::index(rng)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Returns: A range adapted to return
+ both the element and the associated index. The returned range consists
+ of iterators that have in addition to the usual iterator member functions
+ an <code class="computeroutput">index()</code>
+ member function that returns the appropriate index for the element
+ in the sequence corresponding with the iterator.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/indexed.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+template<class Iterator>
+void display_element_and_index(Iterator first, Iterator last)
+{
+ for (Iterator it = first; it != last; ++it)
+ {
+ std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
+ }
+}
+
+template<class SinglePassRange>
+void display_element_and_index(const SinglePassRange& rng)
+{
+ display_element_and_index(boost::begin(rng), boost::end(rng));
+}
+
+template<class Iterator1, class Iterator2>
+void check_element_and_index(
+ Iterator1 test_first,
+ Iterator1 test_last,
+ Iterator2 reference_first,
+ Iterator2 reference_last)
+{
+ BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
+ std::distance(reference_first, reference_last) );
+
+ int reference_index = 0;
+
+ Iterator1 test_it = test_first;
+ Iterator2 reference_it = reference_first;
+ for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
+ {
+ BOOST_CHECK_EQUAL( *test_it, *reference_it );
+ BOOST_CHECK_EQUAL( test_it.index(), reference_index );
+ }
+}
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 10,20,30,40,50,60,70,80,90;
+
+ display_element_and_index( input | indexed(0) );
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">Element = 10 Index = 0
+Element = 20 Index = 1
+Element = 30 Index = 2
+Element = 40 Index = 3
+Element = 50 Index = 4
+Element = 60 Index = 5
+Element = 70 Index = 6
+Element = 80 Index = 7
+Element = 90 Index = 8
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example">
+ indirected example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::indirected</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::indirect(rng)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range defines unary <code class="computeroutput">operator*()</code>
+</li>
+<li class="listitem">
+Postcondition: For all elements <code class="computeroutput">x</code> in the returned range, <code class="computeroutput">x</code> is the result of <code class="computeroutput">*y</code>
+ where <code class="computeroutput">y</code> is the corresponding
+ element in the original range.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/indirected.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/shared_ptr.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+
+ std::vector<boost::shared_ptr<int> > input;
+
+ for (int i = 0; i < 10; ++i)
+ input.push_back(boost::shared_ptr<int>(new int(i)));
+
+ boost::copy(
+ input | indirected,
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">0,1,2,3,4,5,6,7,8,9
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example">
+ map_keys example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::map_keys</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::keys(rng)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range is an instantiation of <code class="computeroutput">std::pair</code>.
+ </li>
+<li class="listitem">
+Postcondition: For all elements <code class="computeroutput">x</code> in the returned range, <code class="computeroutput">x</code> is the result of <code class="computeroutput">y.first</code> where <code class="computeroutput">y</code>
+ is the corresponding element in the original range.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/map.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <map>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::map<int,int> input;
+ for (int i = 0; i < 10; ++i)
+ input.insert(std::make_pair(i, i * 10));
+
+ boost::copy(
+ input | map_keys,
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">0,1,2,3,4,5,6,7,8,9
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example">
+ map_values example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::map_values</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::values(rng)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range is an instantiation of <code class="computeroutput">std::pair</code>.
+ </li>
+<li class="listitem">
+Postcondition: For all elements <code class="computeroutput">x</code> in the returned range, <code class="computeroutput">x</code> is the result of <code class="computeroutput">y.second</code> where <code class="computeroutput">y</code>
+ is the corresponding element in the original range.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/map.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <map>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::map<int,int> input;
+ for (int i = 0; i < 10; ++i)
+ input.insert(std::make_pair(i, i * 10));
+
+ boost::copy(
+ input | map_values,
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">0,10,20,30,40,50,60,70,80,90
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example">
+ replaced example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::replaced(new_value,
+ old_value)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::replace(rng,
+ new_value,
+ old_value)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition:<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+<code class="computeroutput">new_value</code> is convertible
+ to the <code class="computeroutput">value_type</code>
+ of the range.
+ </li>
+<li class="listitem">
+<code class="computeroutput">old_value</code> is convertible
+ to the <code class="computeroutput">value_type</code>
+ of the range.
+ </li>
+</ul></div>
+</li>
+<li class="listitem">
+Postcondition: For all elements <code class="computeroutput">x</code> in the returned range, the value
+ <code class="computeroutput">x</code> is equal to the value
+ of <code class="computeroutput">(y
+ == old_value) ? new_value :
+ y</code> where <code class="computeroutput">y</code>
+ is the corresponding element in the original range.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+ Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/replaced.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,2,5,2,7,2,9;
+
+ boost::copy(
+ input | replaced(2, 10),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">1,10,3,10,5,10,7,10,9
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example">
+ replaced_if example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::replaced_if(pred,
+ new_value)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::replace_if(rng,
+ pred,
+ new_value)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition:<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ The range <code class="computeroutput">value_type</code>
+ is convertible to the argument type of <code class="computeroutput">pred</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">new_value</code> is convertible
+ to the <code class="computeroutput">value_type</code>
+ of the range.
+ </li>
+</ul></div>
+</li>
+<li class="listitem">
+Postconditions: For all elements
+ <code class="computeroutput">x</code> in the returned range,
+ the value <code class="computeroutput">x</code> is equal
+ to the value of <code class="computeroutput">pred(y) ? new_value :
+ y</code> where <code class="computeroutput">y</code>
+ is the corresponding element in the original range.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+ Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/replaced_if.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+struct is_even
+{
+ bool operator()(int x) const { return x % 2 == 0; }
+};
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | replaced_if(is_even(), 10),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">1,10,3,10,5,10,7,10,9
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example">
+ reversed example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::reversed</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::reverse(rng)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Returns: A range whose iterators behave
+ as if they were the original iterators wrapped in <code class="computeroutput">reverse_iterator</code>.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/reversed.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+void reversed_example_test()
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | reversed,
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">9,8,7,6,5,4,3,2,1
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example">
+ sliced example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::sliced(n,
+ m)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::slice(rng,
+ n,
+ m)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition:<code class="computeroutput">0
+ <= n
+ && n
+ <= m
+ && m
+ < distance(rng)</code>
+</li>
+<li class="listitem">
+Returns:<code class="computeroutput">make_range(rng, n, m)</code>
+</li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+ Access Range</a>
+</li>
+<li class="listitem">
+Returned Range Category:<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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/sliced.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | sliced(2, 5),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">3,4,5
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="strided.html#range.reference.adaptors.reference.strided.strided_example">
+ strided example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::strided(n)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::stride(rng,
+ n)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition:<code class="computeroutput">0
+ <= n
+ && n
+ < distance(rng)</code>
+</li>
+<li class="listitem">
+Returns: A new range based on <code class="computeroutput">rng</code> where traversal is performed
+ in steps of <code class="computeroutput">n</code>.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+ Access Range</a>
+</li>
+<li class="listitem">
+Returned Range Category:<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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/strided.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9,10;
+
+ boost::copy(
+ input | strided(2),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">1,3,5,7,9
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rng | boost::adaptors::tokenized(regex)
+rng | boost::adaptors::tokenized(regex, i)
+rng | boost::adaptors::tokenized(regex, rndRng)
+rng | boost::adaptors::tokenized(regex, i, flags)
+rng | boost::adaptors::tokenized(regex, rndRng, flags)
+</pre>
+
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">boost::adaptors::tokenize(rng, regex)
+boost::adaptors::tokenize(rng, regex, i)
+boost::adaptors::tokenize(rng, regex, rndRng)
+boost::adaptors::tokenize(rng, regex, i, flags)
+boost::adaptors::tokenize(rng, regex, rndRng, flags)
+</pre>
+
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition:<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ Let <code class="computeroutput">T</code> denote <code class="computeroutput">typename range_value<decltype(rng)>::type</code>,
+ then <code class="computeroutput">regex</code> has
+ the type <code class="computeroutput">basic_regex<T></code> or is implicitly convertible
+ to one of these types.
+ </li>
+<li class="listitem">
+<code class="computeroutput">i</code> has the type
+ <code class="computeroutput">int</code>.
+ </li>
+<li class="listitem">
+ the <code class="computeroutput">value_type</code>
+ of <code class="computeroutput">rndRng</code> is <code class="computeroutput">int</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">flags</code> has the type
+ <code class="computeroutput">regex_constants::syntax_option_type</code>.
+ </li>
+</ul></div>
+</li>
+<li class="listitem">
+Returns: A range whose iterators behave
+ as if they were the original iterators wrapped in <code class="computeroutput">regex_token_iterator</code>.
+ The first iterator in the range would be constructed by forwarding
+ all the arguments of <code class="computeroutput">tokenized()</code> to the <code class="computeroutput">regex_token_iterator</code>
+ constructor.
+ </li>
+<li class="listitem">
+Throws: Whatever constructing and
+ copying equivalent <code class="computeroutput">regex_token_iterator</code>s
+ might throw.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+ Access Range</a>
+</li>
+<li class="listitem">
+Returned Range Category:<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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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><a href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example">
+ transformed example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::transformed(fun)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::transform(rng,
+ fun)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range is convertible to the argument type of <code class="computeroutput">fun</code>.
+ </li>
+<li class="listitem">
+Postcondition: For all elements <code class="computeroutput">x</code> in the returned range, <code class="computeroutput">x</code> is the result of <code class="computeroutput">fun(y)</code>
+ where <code class="computeroutput">y</code> is the corresponding
+ element in the original range.
+ </li>
+<li class="listitem">
+Throws: Whatever the copy-constructor
+ of <code class="computeroutput">fun</code> might throw.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The range
+ category of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/transformed.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+struct double_int
+{
+ typedef int result_type;
+ int operator()(int x) const { return x * 2; }
+};
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9,10;
+
+ boost::copy(
+ input | transformed(double_int()),
+ std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">2,4,6,8,10,12,14,16,18,20
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="transformed.html" title="transformed">
+<link rel="next" href="../../algorithms.html" title="Range Algorithm">
+</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><a href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example">
+ uniqued example</a></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Syntax
+ 
+ </th>
+<th>
+ 
+ Code
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ Pipe
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">rng |
+ boost::adaptors::uniqued</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Function
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">boost::adaptors::unique(rng)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+Precondition: The <code class="computeroutput">value_type</code>
+ of the range is comparable with <code class="computeroutput">operator==()</code>.
+ </li>
+<li class="listitem">
+Postcondition: For all adjacent elements
+ <code class="computeroutput">[x,y]</code> in the returned range, <code class="computeroutput">x==y</code> is false.
+ </li>
+<li class="listitem">
+Range Category:<a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+ Range</a>
+</li>
+<li class="listitem">
+Returned Range Category: The minimum
+ of the range concept of <code class="computeroutput">rng</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>
+
+
+
+<pre class="programlisting">#include <boost/range/adaptor/uniqued.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+void uniqued_example_test()
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,1,2,2,2,3,4,5,6;
+
+ boost::copy(
+ input | uniqued,
+ std::ostream_iterator<int>(std::cout, ","));
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">1,2,3,4,5,6
+</pre>
+
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="adaptors/reference/uniqued.html" title="uniqued">
+<link rel="next" href="algorithms/range_algorithm_introduction.html" title="Introduction and motivation">
+</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><a href="algorithms/range_algorithm_introduction.html">
+ Introduction and motivation</a></dt>
+<dt> Mutating algorithms</dt>
+<dt><a href="algorithms/non_mutating.html"> Non-mutating
+ algorithms</a></dt>
+<dt> Set algorithms</dt>
+<dt> Heap algorithms</dt>
+<dt><a href="algorithms/permutation.html"> Permutation
+ algorithms</a></dt>
+<dt> New algorithms</dt>
+<dt> Numeric algorithms</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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> push_heap</dt>
+<dt> pop_heap</dt>
+<dt> make_heap</dt>
+<dt> sort_heap</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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class RandomAccessRange>
+RandomAccessRange& make_heap(RandomAccessRange& rng);
+
+template<class RandomAccessRange>
+const RandomAccessRange& make_heap(const RandomAccessRange& rng);
+
+template<class RandomAccessRange, class Compare>
+RandomAccessRange& make_heap(RandomAccessRange& rng, Compare pred);
+
+template<class RandomAccessRange, class Compare>
+const RandomAccessRange& make_heap(const RandomAccessRange& rng, Compare pred);
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">make_heap</code> turns <code class="computeroutput">rng</code> into a heap.
+ 
+
+ The ordering relationship is determined by using <code class="computeroutput">operator<</code> in the non-predicate versions, and
+ by evaluating <code class="computeroutput">pred</code> in
+ the predicate versions.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/heap_algorithm.hpp</code>
+ 
+<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>
+
+ For the non-predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is a model of the <code class="computeroutput">LessThanComparableConcept</code>.
+ </li>
+<li class="listitem">
+ The ordering of objects of type <code class="computeroutput">RandomAccessRange</code>'s
+ value type is a strict weak ordering,
+ as defined in the <code class="computeroutput">LessThanComparableConcept</code>
+ requirements.
+ </li>
+</ul></div>
+
+ For the predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Compare</code> is a model
+ of the <code class="computeroutput">StrictWeakOrderingConcept</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is convertible to both of <code class="computeroutput">Compare</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>
+
+ Linear. At most <code class="computeroutput">3 *
+ distance(rng)</code>
+ comparisons.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class RandomAccessRange>
+RandomAccessRange& pop_heap(RandomAccessRange& rng);
+
+template<class RandomAccessRange>
+const RandomAccessRange& pop_heap(const RandomAccessRange& rng);
+
+template<class RandomAccessRange, class Compare>
+RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare pred);
+
+template<class RandomAccessRange, class Compare>
+const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare pred);
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">pop_heap</code> removes the
+ largest element from the heap. It is assumed that <code class="computeroutput">begin(rng), prior(end(rng))</code> is already a heap and that the element
+ to be added is <code class="computeroutput">*prior(end(rng))</code>.
+ 
+
+ The ordering relationship is determined by using <code class="computeroutput">operator<</code> in the non-predicate versions, and
+ by evaluating <code class="computeroutput">pred</code> in
+ the predicate versions.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/heap_algorithm.hpp</code>
+ 
+<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>
+
+ For the non-predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is a model of the <code class="computeroutput">LessThanComparableConcept</code>.
+ </li>
+<li class="listitem">
+ The ordering of objects of type <code class="computeroutput">RandomAccessRange</code>'s
+ value type is a strict weak ordering,
+ as defined in the <code class="computeroutput">LessThanComparableConcept</code>
+ requirements.
+ </li>
+</ul></div>
+
+ For the predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Compare</code> is a model
+ of the <code class="computeroutput">StrictWeakOrderingConcept</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is convertible to both of <code class="computeroutput">Compare</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">!empty(rng)</code></li>
+<li class="listitem">
+<code class="computeroutput">rng</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>
+
+ Logarithmic. At most <code class="computeroutput">2 *
+ log(distance(rng))</code>
+ comparisons.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class RandomAccessRange>
+RandomAccessRange& push_heap(RandomAccessRange& rng);
+
+template<class RandomAccessRange>
+const RandomAccessRange& push_heap(const RandomAccessRange& rng);
+
+template<class RandomAccessRange, class Compare>
+RandomAccessRange& push_heap(RandomAccessRange& rng, Compare pred);
+
+template<class RandomAccessRange, class Compare>
+const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare pred);
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">push_heap</code> adds an element
+ to a heap. It is assumed that <code class="computeroutput">begin(rng)</code>, <code class="computeroutput">prior(end(rng))</code> is already a heap and that the element
+ to be added is <code class="computeroutput">*prior(end(rng))</code>.
+ 
+
+ The ordering relationship is determined by using <code class="computeroutput">operator<</code> in the non-predicate versions, and
+ by evaluating <code class="computeroutput">pred</code> in
+ the predicate versions.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/heap_algorithm.hpp</code>
+ 
+<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>
+
+ For the non-predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is a model of the <code class="computeroutput">LessThanComparableConcept</code>.
+ </li>
+<li class="listitem">
+ The ordering of objects of type <code class="computeroutput">RandomAccessRange</code>'s
+ value type is a strict weak ordering,
+ as defined in the <code class="computeroutput">LessThanComparableConcept</code>
+ requirements.
+ </li>
+</ul></div>
+
+ For the predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Compare</code> is a model
+ of the <code class="computeroutput">StrictWeakOrderingConcept</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is convertible to both of <code class="computeroutput">Compare</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">!empty(rng)</code></li>
+<li class="listitem">
+<code class="computeroutput">[begin(rng), prior(end(rng)))</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>
+
+ Logarithmic. At most <code class="computeroutput">log(distance(rng))</code> comparisons.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class RandomAccessRange>
+RandomAccessRange& sort_heap(RandomAccessRange& rng);
+
+template<class RandomAccessRange>
+const RandomAccessRange& sort_heap(const RandomAccessRange& rng);
+
+template<class RandomAccessRange, class Compare>
+RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare pred);
+
+template<class RandomAccessRange, class Compare>
+const RandomAccessRange& sort_heap(const RandomAccessRange& rng, Compare pred);
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">sort_heap</code> turns a heap
+ into a sorted range.
+ 
+
+ The ordering relationship is determined by using <code class="computeroutput">operator<</code> in the non-predicate versions, and
+ by evaluating <code class="computeroutput">pred</code> in
+ the predicate versions.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/heap_algorithm.hpp</code>
+ 
+<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>
+
+ For the non-predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is a model of the <code class="computeroutput">LessThanComparableConcept</code>.
+ </li>
+<li class="listitem">
+ The ordering of objects of type <code class="computeroutput">RandomAccessRange</code>'s
+ value type is a strict weak ordering,
+ as defined in the <code class="computeroutput">LessThanComparableConcept</code>
+ requirements.
+ </li>
+</ul></div>
+
+ For the predicate versions:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</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">RandomAccessRange</code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Compare</code> is a model
+ of the <code class="computeroutput">StrictWeakOrderingConcept</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">RandomAccessRange</code>'s
+ value type is convertible to both of <code class="computeroutput">Compare</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>
+
+ <code class="computeroutput">rng</code> is a heap.
+ 
+<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>
+
+ At most <code class="computeroutput">N *
+ log(N)</code>
+ comparisons, where <code class="computeroutput">N</code>
+ is <code class="computeroutput">distance(rng)</code>.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. Range 2.0">
+<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
+<link rel="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> copy</dt>
+<dt><a href="mutating/copy_backward.html">
+ copy_backward</a></dt>
+<dt> fill</dt>
+<dt> fill_n</dt>
+<dt> generate</dt>
+<dt><a href="mutating/inplace_merge.html">
+ inplace_merge</a></dt>
+<dt> merge</dt>
+<dt><a href="mutating/nth_element.html">
+ nth_element</a></dt>
+<dt><a href="mutating/partial_sort.html">
+ partial_sort</a></dt>
+<dt> partition</dt>
+<dt><a href="mutating/random_shuffle.html">
+ random_shuffle</a></dt>
+<dt> remove</dt>
+<dt><a href="mutating/remove_copy.html">
+ remove_copy</a></dt>
+<dt><a href="mutating/remove_copy_if.html">
+ remove_copy_if</a></dt>
+<dt> remove_if</dt>
+<dt> replace</dt>
+<dt><a href="mutating/replace_copy.html">
+ replace_copy</a></dt>
+<dt><a href="mutating/replace_copy_if.html">
+ replace_copy_if</a></dt>
+<dt><a href="mutating/replace_if.html">
+ replace_if</a></dt>
+<dt> reverse</dt>
+<dt><a href="mutating/reverse_copy.html">
+ reverse_copy</a></dt>
+<dt> rotate</dt>
+<dt><a href="mutating/rotate_copy.html">
+ rotate_copy</a></dt>
+<dt> sort</dt>
+<dt><a href="mutating/stable_partition.html">
+ stable_partition</a></dt>
+<dt><a href="mutating/stable_sort.html">
+ stable_sort</a></dt>
+<dt><a href="mutating/swap_ranges.html">
+ swap_ranges</a></dt>
+<dt> transform</dt>
+<dt> unique</dt>
+<dt><a href="mutating/unique_copy.html">
+ unique_copy</a></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 © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class SinglePassRange, class OutputIterator>
+OutputIterator copy(const SinglePassRange& source_rng, OutputIterator out_it);
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">copy</code> copies all elements
+ from <code class="computeroutput">source_rng</code> to the
+ range <code class="computeroutput">[out_it, out_it
+ + distance(source_rng))</code>. The return value is <code class="computeroutput">out_it +
+ distance(source_rng)</code>
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/copy.hpp</code>
+ 
+<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">SinglePassRange</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">OutputIterator</code> is a
+ model of the <code class="computeroutput">OutputIteratorConcept</code>.
+ </li>
+<li class="listitem">
+ The <code class="computeroutput">value_type</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">OutputIterator</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">out_it</code> is not an iterator
+ within the <code class="computeroutput">source_rng</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">[out_it, out_it
+ + distance(source_rng))</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>
+
+ Linear. Exactly <code class="computeroutput">distance(source_rng)</code> assignments are performed.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class BidirectionalRange, class BidirectionalOutputIterator>
+ BidirectionalOutputIterator
+ copy_backward(const BidirectionalRange& source_rng,
+ BidirectionalOutputIterator out_it);
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">copy_backward</code> copies
+ all elements from <code class="computeroutput">source_rng</code>
+ to the range <code class="computeroutput">[out_it
+ - distance(source_rng), out_it)</code>.
+ 
+
+ The values are copied in reverse order. The return value is <code class="computeroutput">out_it -
+ distance(source_rng)</code>.
+ 
+
+ Note well that unlike all other standard algorithms <code class="computeroutput">out_it</code>
+ denotes the end of the output sequence.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/copy_backward.hpp</code>
+ 
+<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">BidirectionalRange</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">OutputIterator</code> is a
+ model of the <code class="computeroutput">OutputIteratorConcept</code>.
+ </li>
+<li class="listitem">
+ The <code class="computeroutput">value_type</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">OutputIterator</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">out_it</code> is not an iterator
+ within the <code class="computeroutput">source_rng</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">[out_it, out_it
+ + distance(source_rng))</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>
+
+ Linear. Exactly <code class="computeroutput">distance(source_rng)</code> assignments are performed.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class ForwardRange, class Value>
+ForwardRange& fill( ForwardRange& rng, const Value& val );
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">fill</code> assigns the value
+ <code class="computeroutput">val</code> to every element
+ in the range <code class="computeroutput">rng</code>.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/fill.hpp</code>
+ 
+<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">ForwardRange</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">ForwardRange</code> is mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Value</code> is a model of
+ the <code class="computeroutput">AssignableConcept</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Value</code> is convertible
+ to <code class="computeroutput">ForwardRange</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>
+
+ Linear. Exactly <code class="computeroutput">distance(rng)</code> assignments are performed.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class ForwardRange, class Size, class Value>
+ForwardRange& fill( ForwardRange& rng, Size n, const Value& val );
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">fill_n</code> assigns the value
+ <code class="computeroutput">val</code> to <code class="computeroutput">n</code> elements in the range <code class="computeroutput">rng</code> begining with <code class="computeroutput">boost::begin(rng)</code>.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/fill_n.hpp</code>
+ 
+<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">ForwardRange</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">ForwardRange</code> is mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Value</code> is a model of
+ the <code class="computeroutput">AssignableConcept</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Value</code> is convertible
+ to <code class="computeroutput">ForwardRange</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>
+
+ Linear. Exactly <code class="computeroutput">n</code> assignments
+ are performed.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class ForwardRange, class Generator>
+ForwardRange& generate( ForwardRange& rng, Generator gen );
+
+template<class ForwardRange, class Generator>
+const ForwardRange& generate( const ForwardRange& rng, Generator gen );
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">generate</code> assigns the
+ result of <code class="computeroutput">gen()</code>
+ to each element in range <code class="computeroutput">rng</code>.
+ Returns the resultant range.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/generate.hpp</code>
+ 
+<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">ForwardRange</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">ForwardRange</code> is mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">Generator</code> is a model
+ of the <code class="computeroutput">GeneratorConcept</code>.
+ </li>
+<li class="listitem">
+ The <code class="computeroutput">value_type</code> of
+ <code class="computeroutput">SinglePassRange</code> is
+ convertible to a type in <code class="computeroutput">OutputIterator</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">out_it</code> is not an iterator
+ within <code class="computeroutput">rng</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">[out_it, out_it
+ + distance(rng))</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>
+
+ Linear. Exactly <code class="computeroutput">distance(rng)</code> assignments are performed.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</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 1. 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>
+
+
+
+<pre class="programlisting">template<class BidirectionalRange>
+BidirectionalRange&
+inplace_merge( BidirectionalRange& rng,
+ typename range_iterator<BidirectionalRange>::type middle );
+
+template<class BidirectionalRange>
+const BidirectionalRange&
+inplace_merge( const BidirectionalRange& rng,
+ typename range_iterator<const BidirectionalRange>::type middle );
+
+template<class BidirectionalRange, class BinaryPredicate>
+BidirectionalRange&
+inplace_merge( BidirectionalRange& rng,
+ typename range_iterator<BidirectionalRange>::type middle,
+ BinaryPredicate pred );
+
+template<class BidirectionalRange, class BinaryPredicate>
+const BidirectionalRange&
+inplace_merge( const BidirectionalRange& rng,
+ typename range_iterator<const BidirectionalRange>::type middle,
+ BinaryPredicate pred );
+</pre>
+
+ 
+<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>
+
+ <code class="computeroutput">inplace_merge</code> combines
+ two consecutive sorted ranges <code class="computeroutput">[begin(rng), middle)</code>
+ and <code class="computeroutput">[middle, end(rng))</code> into a single sorted range <code class="computeroutput">[begin(rng), end(rng))</code>. That is, it starts with a range <code class="computeroutput">[begin(rng), end(rng))</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">inplace_merge</code>
+ is stable, meaning both that the relative order of elements within each
+ input range is preserved.
+ 
+<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>
+
+ Defined in the header file <code class="computeroutput">boost/range/algorithm/inplace_merge.hpp</code>
+ 
+<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>
+
+ For the non-predicate version:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">BidirectionalRange</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">BidirectionalRange</code>
+ is mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput">range_value<BidirectionalRange>::type</code> is a model of <code class="computeroutput">LessThanComparableConcept</code>
+</li>
+<li class="listitem">
+ The ordering on objects of <code class="computeroutput">range_type<BidirectionalRange>::type</code>
+ is a strict weak ordering,
+ as defined in the <code class="computeroutput">LessThanComparableConcept</code>
+ requirements.
+ </li>
+</ul></div>
+
+ For the predicate version: * <code class="computeroutput">BidirectionalRange</code> is a model of the
+ <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
+ Concept. * <code class="computeroutput">BidirectionalRange</code>
+ is mutable. * <code class="computeroutput">BinaryPredicate</code>
+ is a model of the <code class="computeroutput">StrictWeakOrderingConcept</code>.
+ * <code class="computeroutput">BidirectionalRange</code>'s
+ value type is convertible to both <code class="computeroutput">BinaryPredicate</code>'s
+ argument types.
+ 
+<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">middle</code> is in the range
+ <code class="computeroutput">rng</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">[begin(rng), middle)</code> is in ascending order. That is for
+ each pair of adjacent elements <code class="computeroutput">[x,y]</code>,
+ <code class="computeroutput">y <
+ x</code> is <code class="computeroutput">false</code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput">[<span class="identifier&quo