Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r80717 - in website/public_html/beta/doc: fixes fixes/boost_1_33_1 fixes/boost_1_33_1/libs fixes/boost_1_34_0 fixes/boost_1_34_0/libs fixes/boost_1_35_0 fixes/boost_1_35_0/libs fixes/boost_1_36_0 fixes/boost_1_36_0/libs fixes/boost_1_37_0 fixes/boost_1_37_0/libs fixes/boost_1_38_0 fixes/boost_1_38_0/libs fixes/boost_1_39_0 fixes/boost_1_39_0/libs fixes/boost_1_40_0 fixes/boost_1_40_0/libs fixes/boost_1_41_0 fixes/boost_1_41_0/libs fixes/boost_1_42_0 fixes/boost_1_42_0/libs fixes/boost_1_43_0 fixes/boost_1_43_0/libs fixes/boost_1_43_0/libs/range fixes/boost_1_43_0/libs/range/doc fixes/boost_1_43_0/libs/range/doc/html fixes/boost_1_43_0/libs/range/doc/html/range fixes/boost_1_43_0/libs/range/doc/html/range/concepts fixes/boost_1_43_0/libs/range/doc/html/range/library_headers fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl fixes/boost_1_43_0/libs/range/doc/html/range/reference fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3 fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities fixes/boost_1_43_0/libs/range/doc/html/range/upgrade fixes/boost_1_44_0 fixes/boost_1_44_0/libs fixes/boost_1_45_0 fixes/boost_1_45_0/libs fixes/boost_1_45_0/libs/filesystem fixes/boost_1_45_0/libs/filesystem/v2 fixes/boost_1_45_0/libs/filesystem/v2/doc fixes/boost_1_45_0/libs/filesystem/v3 fixes/boost_1_45_0/libs/filesystem/v3/doc fixes/boost_1_46_1 fixes/boost_1_46_1/more fixes/boost_1_46_1/more/getting_started fixes/boost_1_48_0 fixes/boost_1_48_0/libs fixes/boost_1_48_0/libs/timer fixes/boost_1_49_0 fixes/boost_1_49_0/libs fixes/boost_1_49_0/libs/phoenix fixes/boost_1_49_0/libs/phoenix/doc fixes/boost_1_49_0/libs/phoenix/doc/html fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/expression fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/function fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/what_s_new fixes/boost_1_50_0 fixes/boost_1_50_0/libs fixes/boost_1_50_0/libs/phoenix fixes/boost_1_50_0/libs/phoenix/doc fixes/boost_1_50_0/libs/phoenix/doc/html fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/expression fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/function fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/what_s_new libs/1_33_1/libs libs/1_34_0/libs libs/1_35_0/libs libs/1_36_0/libs libs/1_37_0/libs libs/1_38_0/libs libs/1_39_0/libs libs/1_40_0/libs libs/1_41_0/libs libs/1_42_0/libs libs/1_43_0/libs libs/1_43_0/libs/range/doc/html libs/1_43_0/libs/range/doc/html/range libs/1_43_0/libs/range/doc/html/range/concepts libs/1_43_0/libs/range/doc/html/range/library_headers libs/1_43_0/libs/range/doc/html/range/mfc_atl libs/1_43_0/libs/range/doc/html/range/reference libs/1_43_0/libs/range/doc/html/range/reference/adaptors libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference libs/1_43_0/libs/range/doc/html/range/reference/algorithms libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics libs/1_43_0/libs/range/doc/html/range/reference/extending libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3 libs/1_43_0/libs/range/doc/html/range/reference/ranges libs/1_43_0/libs/range/doc/html/range/reference/utilities libs/1_43_0/libs/range/doc/html/range/upgrade libs/1_44_0/libs libs/1_45_0/libs libs/1_45_0/libs/filesystem/v2/doc libs/1_45_0/libs/filesystem/v3/doc libs/1_46_1/more/getting_started libs/1_48_0/libs libs/1_48_0/libs/timer libs/1_49_0/libs/phoenix/doc/html libs/1_49_0/libs/phoenix/doc/html/images libs/1_49_0/libs/phoenix/doc/html/phoenix libs/1_49_0/libs/phoenix/doc/html/phoenix/examples libs/1_49_0/libs/phoenix/doc/html/phoenix/inside libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression libs/1_49_0/libs/phoenix/doc/html/phoenix/modules libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new libs/1_50_0/libs/phoenix/doc/html libs/1_50_0/libs/phoenix/doc/html/images libs/1_50_0/libs/phoenix/doc/html/phoenix libs/1_50_0/libs/phoenix/doc/html/phoenix/examples libs/1_50_0/libs/phoenix/doc/html/phoenix/inside libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression libs/1_50_0/libs/phoenix/doc/html/phoenix/modules libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new
From: dnljms_at_[hidden]
Date: 2012-09-26 16:10:11


Author: danieljames
Date: 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
New Revision: 80717
URL: http://svn.boost.org/trac/boost/changeset/80717

Log:
Website: Move all the documentation fixes.

They're now going to be served using the normal documentation scripts,
but to do that they need to be in a different location, so that apache
doesn't try to serve them raw.
Added:
   website/public_html/beta/doc/fixes/
   website/public_html/beta/doc/fixes/boost_1_33_1/
   website/public_html/beta/doc/fixes/boost_1_33_1/libs/
   website/public_html/beta/doc/fixes/boost_1_33_1/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_33_1/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_34_0/
   website/public_html/beta/doc/fixes/boost_1_34_0/libs/
   website/public_html/beta/doc/fixes/boost_1_34_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_34_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_35_0/
   website/public_html/beta/doc/fixes/boost_1_35_0/libs/
   website/public_html/beta/doc/fixes/boost_1_35_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_35_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_36_0/
   website/public_html/beta/doc/fixes/boost_1_36_0/libs/
   website/public_html/beta/doc/fixes/boost_1_36_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_36_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_37_0/
   website/public_html/beta/doc/fixes/boost_1_37_0/libs/
   website/public_html/beta/doc/fixes/boost_1_37_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_37_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_38_0/
   website/public_html/beta/doc/fixes/boost_1_38_0/libs/
   website/public_html/beta/doc/fixes/boost_1_38_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_38_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_39_0/
   website/public_html/beta/doc/fixes/boost_1_39_0/libs/
   website/public_html/beta/doc/fixes/boost_1_39_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_39_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_40_0/
   website/public_html/beta/doc/fixes/boost_1_40_0/libs/
   website/public_html/beta/doc/fixes/boost_1_40_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_40_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_41_0/
   website/public_html/beta/doc/fixes/boost_1_41_0/libs/
   website/public_html/beta/doc/fixes/boost_1_41_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_41_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_42_0/
   website/public_html/beta/doc/fixes/boost_1_42_0/libs/
   website/public_html/beta/doc/fixes/boost_1_42_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_42_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_43_0/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/index.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/index.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/concept_checking.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/forward_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/overview.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/random_access_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/examples.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/examples.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/faq.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/faq.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/history_ack.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/introduction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/adaptors.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/algorithm.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/general.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/portability.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/portability.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_1.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_2.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/overview.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/overview.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/irange.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/join.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/style_guide.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade/
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html
   website/public_html/beta/doc/fixes/boost_1_44_0/
   website/public_html/beta/doc/fixes/boost_1_44_0/libs/
   website/public_html/beta/doc/fixes/boost_1_44_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_44_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_45_0/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v2/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v2/doc/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v2/doc/index.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v2/doc/index.htm
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v3/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v3/doc/
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v3/doc/index.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v3/doc/index.htm
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_45_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_46_1/
   website/public_html/beta/doc/fixes/boost_1_46_1/more/
   website/public_html/beta/doc/fixes/boost_1_46_1/more/getting_started/
   website/public_html/beta/doc/fixes/boost_1_46_1/more/getting_started/unix-variants.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_46_1/more/getting_started/unix-variants.html
   website/public_html/beta/doc/fixes/boost_1_48_0/
   website/public_html/beta/doc/fixes/boost_1_48_0/libs/
   website/public_html/beta/doc/fixes/boost_1_48_0/libs/libraries.htm (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_48_0/libs/libraries.htm
   website/public_html/beta/doc/fixes/boost_1_48_0/libs/timer/
   website/public_html/beta/doc/fixes/boost_1_48_0/libs/timer/index.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_48_0/libs/timer/index.html
   website/public_html/beta/doc/fixes/boost_1_49_0/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/index.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/index.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/actor.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/actor.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/basics.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/basics.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/introduction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/introduction.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/function/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/organization.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/organization.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/references.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html
   website/public_html/beta/doc/fixes/boost_1_50_0/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/index.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/index.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/actor.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/actor.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/basics.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/basics.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/introduction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/introduction.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/function/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/organization.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/organization.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/references.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html (contents, props changed)
      - copied, changed from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html
Removed:
   website/public_html/beta/doc/libs/1_33_1/libs/libraries.htm
   website/public_html/beta/doc/libs/1_34_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_35_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_36_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_37_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_38_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_39_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_40_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_41_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_42_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_43_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/index.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/examples.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/faq.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/portability.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/overview.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html
   website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html
   website/public_html/beta/doc/libs/1_44_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v2/doc/index.htm
   website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v3/doc/index.htm
   website/public_html/beta/doc/libs/1_45_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_46_1/more/getting_started/unix-variants.html
   website/public_html/beta/doc/libs/1_48_0/libs/libraries.htm
   website/public_html/beta/doc/libs/1_48_0/libs/timer/index.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/add2.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/add2_call.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/adder.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/alert.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/banner.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/fbox.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/funnel_in.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/funnel_out.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/home.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/important.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/lambda_cpp.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/next.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/note.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/organization.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/organization_alt.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/prev.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/simple_ast.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/smiley.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/tip.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/up.png
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/index.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/actor.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/basics.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/introduction.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/organization.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/references.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html
   website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/add2.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/add2_call.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/adder.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/alert.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/banner.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/fbox.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/funnel_in.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/funnel_out.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/home.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/important.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/lambda_cpp.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/next.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/note.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/organization.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/organization_alt.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/prev.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/simple_ast.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/smiley.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/tip.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/up.png
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/index.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/actor.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/basics.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/introduction.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/organization.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/references.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html
   website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html
Text files modified:
   website/public_html/beta/doc/fixes/boost_1_34_0/libs/libraries.htm | 13
   website/public_html/beta/doc/fixes/boost_1_35_0/libs/libraries.htm | 14
   website/public_html/beta/doc/fixes/boost_1_36_0/libs/libraries.htm | 14
   website/public_html/beta/doc/fixes/boost_1_37_0/libs/libraries.htm | 18
   website/public_html/beta/doc/fixes/boost_1_38_0/libs/libraries.htm | 14
   website/public_html/beta/doc/fixes/boost_1_39_0/libs/libraries.htm | 5
   website/public_html/beta/doc/fixes/boost_1_40_0/libs/libraries.htm | 5
   website/public_html/beta/doc/fixes/boost_1_41_0/libs/libraries.htm | 4
   website/public_html/beta/doc/fixes/boost_1_42_0/libs/libraries.htm | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/libraries.htm | 8
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/concept_checking.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/introduction.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html | 24 +-
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html | 14
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html | 30 +-
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_2.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html | 4
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html | 8
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/irange.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html | 52 ++--
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/join.html | 2
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html | 30 +-
   website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/style_guide.html | 4
   website/public_html/beta/doc/fixes/boost_1_44_0/libs/libraries.htm | 8
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v2/doc/index.htm | 404 ++++++++++++++++++++--------------------
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v3/doc/index.htm | 292 ++++++++++++++--------------
   website/public_html/beta/doc/fixes/boost_1_45_0/libs/libraries.htm | 8
   website/public_html/beta/doc/fixes/boost_1_48_0/libs/timer/index.html | 2
   website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html | 4
   website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html | 5
   126 files changed, 617 insertions(+), 621 deletions(-)

Copied: website/public_html/beta/doc/fixes/boost_1_33_1/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_33_1/libs/libraries.htm)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_34_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_34_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_34_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_34_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -208,8 +208,8 @@
     <li>smart_ptr - Five smart
         pointer class templates, from Greg Colvin, Beman Dawes,
         Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
+ <li>statechart - Arbitrarily
+ complex finite state machines can be implemented in easily readable and
     maintainable C++ code, from Andreas Huber.</li>
     <li>static_assert
         - Static assertions (compile time assertions), from John
@@ -230,7 +230,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko Järvi.</li>
@@ -573,14 +573,14 @@
     wrapper for optional values, from Fernando Cacciola.</li>
     <li>program_options - Access to configuration
         data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
+ <li>statechart - Arbitrarily
+ complex finite state machines can be implemented in easily readable and
     maintainable C++ code, from Andreas Huber.</li>
     <li>timer - Event timer,
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
@@ -630,4 +630,3 @@
 
 </body>
 </html>
-

Copied: website/public_html/beta/doc/fixes/boost_1_35_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_35_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_35_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_35_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -243,8 +243,8 @@
     Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
     <li>string_algo -
     String algorithms library, from Pavol Droba.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
+ <li>system - Operating system support,
+ including the diagnostics support that will be part of the C++0x standard
     library, from Beman Dawes.</li>
     <li>test - Support for simple program testing,
     full unit testing, and for program
@@ -257,7 +257,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J?rvi.</li>
@@ -443,7 +443,7 @@
     <li>function_types - Type traits
         for callable, built-in types, from Tobias Schwinger</li>
     <li>fusion -
- Library for working with tuples, including various containers,
+ Library for working with tuples, including various containers,
     algorithms, etc. </li>
     <li>mpl - Template metaprogramming
     framework of compile-time algorithms, sequences and metafunction classes,
@@ -647,14 +647,14 @@
     <li>statechart - Arbitrarily
     complex finite state machines can be implemented in easily readable and
     maintainable C++ code, from Andreas Huber.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
+ <li>system - Operating
+ system support, including the diagnostics support that will be part of the
     C++0x standard library, from Beman Dawes.</li>
     <li>timer - Event timer,
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>

Copied: website/public_html/beta/doc/fixes/boost_1_36_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_36_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_36_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_36_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -245,8 +245,8 @@
     Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
     <li>string_algo -
     String algorithms library, from Pavol Droba.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
+ <li>system - Operating system support,
+ including the diagnostics support that will be part of the C++0x standard
     library, from Beman Dawes.</li>
     <li>test - Support for simple program testing,
     full unit testing, and for program
@@ -259,7 +259,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J?rvi.</li>
@@ -450,7 +450,7 @@
     <li>function_types - Type traits
         for callable, built-in types, from Tobias Schwinger</li>
     <li>fusion -
- Library for working with tuples, including various containers,
+ Library for working with tuples, including various containers,
     algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
     <li>mpl - Template metaprogramming
     framework of compile-time algorithms, sequences and metafunction classes,
@@ -658,14 +658,14 @@
     <li>statechart - Arbitrarily
     complex finite state machines can be implemented in easily readable and
     maintainable C++ code, from Andreas Huber.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
+ <li>system - Operating
+ system support, including the diagnostics support that will be part of the
     C++0x standard library, from Beman Dawes.</li>
     <li>timer - Event timer,
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>

Copied: website/public_html/beta/doc/fixes/boost_1_37_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_37_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_37_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_37_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -209,7 +209,7 @@
     <li>property map
         - Concepts defining interfaces which map key objects to
         value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
+ <li>proto - Expression template library and compiler
         construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
     <li>python - Reflects C++
         classes and functions into <a
@@ -247,8 +247,8 @@
     Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
     <li>string_algo -
     String algorithms library, from Pavol Droba.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
+ <li>system - Operating system support,
+ including the diagnostics support that will be part of the C++0x standard
     library, from Beman Dawes.</li>
     <li>test - Support for simple program testing,
     full unit testing, and for program
@@ -261,7 +261,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J?rvi.</li>
@@ -438,7 +438,7 @@
     <li>property map
         - Concepts defining interfaces which map key objects to
         value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
+ <li>proto - Expression template library and compiler
         construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
     <li>static_assert
         - Static assertions (compile time assertions), from John
@@ -454,7 +454,7 @@
     <li>function_types - Type traits
         for callable, built-in types, from Tobias Schwinger</li>
     <li>fusion -
- Library for working with tuples, including various containers,
+ Library for working with tuples, including various containers,
     algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
     <li>mpl - Template metaprogramming
     framework of compile-time algorithms, sequences and metafunction classes,
@@ -662,14 +662,14 @@
     <li>statechart - Arbitrarily
     complex finite state machines can be implemented in easily readable and
     maintainable C++ code, from Andreas Huber.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
+ <li>system - Operating
+ system support, including the diagnostics support that will be part of the
     C++0x standard library, from Beman Dawes.</li>
     <li>timer - Event timer,
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>

Copied: website/public_html/beta/doc/fixes/boost_1_38_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_38_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_38_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_38_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -259,8 +259,8 @@
     String algorithms library, from Pavol Droba.</li>
     <li>swap -
     Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
+ <li>system - Operating system support,
+ including the diagnostics support that will be part of the C++0x standard
     library, from Beman Dawes.</li>
     <li>test - Support for simple program testing,
     full unit testing, and for program
@@ -273,7 +273,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J?rvi.</li>
@@ -464,7 +464,7 @@
     <li>function_types - Type traits
         for callable, built-in types, from Tobias Schwinger</li>
     <li>fusion -
- Library for working with tuples, including various containers,
+ Library for working with tuples, including various containers,
     algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
     <li>mpl - Template metaprogramming
     framework of compile-time algorithms, sequences and metafunction classes,
@@ -680,14 +680,14 @@
     maintainable C++ code, from Andreas Huber.</li>
     <li>swap -
     Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
+ <li>system - Operating
+ system support, including the diagnostics support that will be part of the
     C++0x standard library, from Beman Dawes.</li>
     <li>timer - Event timer,
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>

Copied: website/public_html/beta/doc/fixes/boost_1_39_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_39_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_39_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_39_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -270,7 +270,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J&auml;rvi.</li>
@@ -686,7 +686,7 @@
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
@@ -739,4 +739,3 @@
 
 </body>
 </html>
-

Copied: website/public_html/beta/doc/fixes/boost_1_40_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_40_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_40_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_40_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -275,7 +275,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J&auml;rvi.</li>
@@ -691,7 +691,7 @@
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
@@ -744,4 +744,3 @@
 
 </body>
 </html>
-

Copied: website/public_html/beta/doc/fixes/boost_1_41_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_41_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_41_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_41_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -281,7 +281,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J&auml;rvi.</li>
@@ -705,7 +705,7 @@
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>

Copied: website/public_html/beta/doc/fixes/boost_1_42_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_42_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_42_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_42_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -281,7 +281,7 @@
     <li>tokenizer - Break of a string or other
       character sequence into a series of tokens, from John Bandela.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>tuple - Ease definition of functions returning multiple values, and more,
     from Jaakko J&auml;rvi.</li>
@@ -707,7 +707,7 @@
     progress timer, and progress display classes, from Beman
     Dawes.</li>
     <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
+ Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
     <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
     <li>typeof -
         Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -236,10 +236,10 @@
         Abrahams.</li>
     <li>random - A complete
         system for random number generation, from Jens Maurer.</li>
- <li>range - Concepts and utilities for
- range-based algorithms, as well as range-based algorithms and range
- adaptors that allow for efficient and very expressive code, from
- Thorsten Ottosen and Neil Groves.</li>
+ <li>range - Concepts and utilities for
+ range-based algorithms, as well as range-based algorithms and range
+ adaptors that allow for efficient and very expressive code, from
+ Thorsten Ottosen and Neil Groves.</li>
     <li>rational - A rational
         number class, from Paul Moore.</li>
 

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/index.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/index.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/concept_checking.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/concept_checking.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -38,7 +38,7 @@
         Range</a> concept.
       </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
 </pre>
@@ -50,7 +50,7 @@
         ForwardReadableRange, the following code is required.
       </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
 <span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ReadableIteratorConcept</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">));</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/forward_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/overview.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/random_access_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/examples.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/examples.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/faq.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/faq.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/history_ack.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/introduction.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/introduction.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -74,7 +74,7 @@
       ):
     </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="comment">//
 </span><span class="comment">// example: extracting bounds in a generic algorithm

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/adaptors.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/algorithm.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/library_headers/general.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -108,7 +108,7 @@
       and string types.
     </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">CTypedPtrArray</span><span class="special">&lt;</span><span class="identifier">CPtrArray</span><span class="special">,</span> <span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">CString</span><span class="special">&gt;</span> <span class="special">*&gt;</span> <span class="identifier">myArray</span><span class="special">;</span>
 <span class="special">...</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -33,7 +33,7 @@
         be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
       </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObList</span><span class="special">)</span>
     <span class="keyword">return</span> <span class="identifier">CObject</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&amp;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/references.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/portability.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/portability.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -87,7 +87,7 @@
           regardless of the input.
         </p>
 <p>
- Furthermore, the following rules apply to any expression of the form
+ Furthermore, the following rules apply to any expression of the form
 </p>
 <pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adaptor_generator</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -35,7 +35,7 @@
           In this example
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -55,7 +55,7 @@
           do not need to know it. All that is relevant is that the expression
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
 </pre>
@@ -82,7 +82,7 @@
           Why do I prefer the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code> syntax? The answer is readability:
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span>
@@ -95,7 +95,7 @@
           much worse. Just compare
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">)</span> <span class="special">),</span>
@@ -107,7 +107,7 @@
           to
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
@@ -164,12 +164,12 @@
           Adaptor alternative to copy_if algorithm</a>
         </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">);</span>
 </pre>
 <p>
- can be expressed as
+ can be expressed as
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
 </pre>
@@ -181,12 +181,12 @@
           Adaptor alternative to count_if algorithm</a>
         </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">);</span>
 </pre>
 <p>
- can be expressed as
+ can be expressed as
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
 </pre>
@@ -199,7 +199,7 @@
           the somewhat misdesigned <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">()</span></code> which may be used as
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
@@ -210,7 +210,7 @@
           With adaptors and algorithms we can express this as
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">));</span>
@@ -226,7 +226,7 @@
         </p>
 <p>
           2. it is <span class="emphasis"><em><span class="bold"><strong>flexible</strong></span></em></span>
- as we can subsequently apply even more adaptors, for example:
+ as we can subsequently apply even more adaptors, for example:
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
                           <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -105,7 +105,7 @@
             adjacent_filtered example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -134,7 +134,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -105,7 +105,7 @@
             copied example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">copied</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -133,7 +133,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -105,7 +105,7 @@
             filtered example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -136,7 +136,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -97,7 +97,7 @@
             indexed example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indexed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -159,7 +159,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="identifier">Element</span> <span class="special">=</span> <span class="number">10</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">0</span>
 <span class="identifier">Element</span> <span class="special">=</span> <span class="number">20</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">1</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -98,7 +98,7 @@
             indirected example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -127,7 +127,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -97,7 +97,7 @@
             map_keys example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -127,7 +127,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -97,7 +97,7 @@
             map_values example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -127,7 +127,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -114,7 +114,7 @@
             replaced example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -142,7 +142,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -114,7 +114,7 @@
             replaced_if example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -147,7 +147,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -93,7 +93,7 @@
             reversed example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">reversed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -121,7 +121,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -103,7 +103,7 @@
             sliced example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">sliced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -131,7 +131,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -100,7 +100,7 @@
             strided example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">strided</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -128,7 +128,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -52,7 +52,7 @@
                   </td>
 <td>
                     <p>
-
+
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">)</span>
 <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
@@ -72,7 +72,7 @@
                   </td>
 <td>
                     <p>
-
+
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">)</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -104,7 +104,7 @@
             transformed example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">transformed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -138,7 +138,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -98,7 +98,7 @@
             uniqued example</a>
 </h6></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">uniqued</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -124,7 +124,7 @@
             </p>
 </div>
 <p>
- This would produce the output:
+ This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BidirectionalOutputIterator</span><span class="special">&gt;</span>
     <span class="identifier">BidirectionalOutputIterator</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/generate.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">generate</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span> <span class="identifier">gen</span> <span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">replace_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">replace_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">reverse</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">reverse_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rotate</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">rotate_copy</span><span class="special">(</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">swap_ranges</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">&gt;</span>
 <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">erase</span><span class="special">(</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">&gt;</span>
 <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -66,7 +66,7 @@
     <span class="special">&gt;</span>
 <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
           <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
  </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -44,7 +44,7 @@
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
     <span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
     <span class="special">&gt;</span>
-<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
+<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
 </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -48,7 +48,7 @@
     <span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                              <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
          <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
          <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -34,7 +34,7 @@
           <span class="emphasis"><em>one</em></span> range argument. For example, we may write
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
@@ -48,7 +48,7 @@
           instead of
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
 </pre>
@@ -61,7 +61,7 @@
 <p>
           One group of algorithms, like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>, will simply return the same range so
           that we can continue to pass the range around and/or further modify it.
- Because of this we may write
+ Because of this we may write
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">:</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">));</span>
 </pre>
@@ -76,7 +76,7 @@
           iterator returned by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
         </p>
 <p>
- Therefore exactly the unique values can be copied by writing
+ Therefore exactly the unique values can be copied by writing
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)),</span>
             <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">));</span>
@@ -204,7 +204,7 @@
           container:
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">&gt;(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)));</span>
@@ -217,7 +217,7 @@
           STL-programming we might write
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="comment">// assume 'vec' is already sorted
 </span><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
@@ -231,7 +231,7 @@
 <p>
         </p>
 <p>
- The same task may be accomplished simply with
+ The same task may be accomplished simply with
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">&gt;(</span><span class="identifier">vec</span><span class="special">));</span>
 </pre>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
@@ -42,7 +42,7 @@
     <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
     <span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -52,7 +52,7 @@
 <span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                                 <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                                 <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -32,7 +32,7 @@
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -54,7 +54,7 @@
 <span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                          <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                          <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
           </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,7 +51,7 @@
 <span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                          <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                          <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
  </pre>
 <p>
           </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -58,7 +58,7 @@
                   </td>
 <td>
                     <p>
-
+
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">iterator</span>
 <span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
@@ -82,7 +82,7 @@
                   </td>
 <td>
                     <p>
-
+
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">const_iterator</span>
 <span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -27,7 +27,7 @@
 <a name="range.reference.concept_implementation.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
 </h4></div></div></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
@@ -43,10 +43,10 @@
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_reference</span><span class="special">;</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_pointer</span><span class="special">;</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_category</span><span class="special">;</span>
 
@@ -115,11 +115,11 @@
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="comment">//
 </span> <span class="comment">// Random Access Range functions
 </span> <span class="comment">//
-</span>
+</span>
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">size</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -129,42 +129,42 @@
 </span> <span class="comment">//
 </span>
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="comment">//
 </span> <span class="comment">// String utilities
 </span> <span class="comment">//
-</span>
+</span>
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
     <span class="identifier">as_literal</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
     <span class="identifier">as_literal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">as_array</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">as_array</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
-<span class="special">}</span> <span class="comment">// namespace 'boost'
+<span class="special">}</span> <span class="comment">// namespace 'boost'
 </span></pre>
 <p>
         </p>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_1.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_2.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_2.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -144,7 +144,7 @@
           A complete example is given here:
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="comment">// for std::iterator_traits, std::distance()

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -33,7 +33,7 @@
           </p>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
- Provide a range for your return type, for example:
+ Provide a range for your return type, for example:
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">reverse_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 
@@ -60,7 +60,7 @@
 </li>
 <li class="listitem">
               Provide a tag to uniquely identify your adaptor in the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
- function overload set
+ function overload set
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">detail</span> <span class="special">{</span>
     <span class="keyword">struct</span> <span class="identifier">reverse_forwarder</span> <span class="special">{};</span>
 <span class="special">}</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -29,7 +29,7 @@
 </h5></div></div></div>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
- Provide a range for your return type, for example:
+ Provide a range for your return type, for example:
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">argument_fwd</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">transform_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -88,7 +88,7 @@
             the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
           </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
 <span class="keyword">class</span> <span class="identifier">replace_holder</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span>
@@ -107,7 +107,7 @@
               Define an instance of the holder with the name of the adaptor
             </li></ol></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">static</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;</span>
 <span class="identifier">replaced</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;();</span>
@@ -118,7 +118,7 @@
               Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
 </li></ol></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
 <span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/overview.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/overview.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Incrementable</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="identifier">Incrementable</span><span class="special">&gt;</span> <span class="special">&gt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/irange.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/irange.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">&gt;</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">&gt;</span> <span class="special">&gt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -31,7 +31,7 @@
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Type</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;</span> <span class="special">&gt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -52,7 +52,7 @@
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
         </h5>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
@@ -67,23 +67,23 @@
     <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
 </span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">End</span> <span class="special">);</span>
-
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
 </span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
+
     <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
 </span> <span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
@@ -92,25 +92,25 @@
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_begin</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_end</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
         <span class="keyword">bool</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
+ <span class="comment">// for Random Access Range only:
 </span> <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">value_type</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
     <span class="special">};</span>
-
+
     <span class="comment">// stream output
 </span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span>
     <span class="keyword">operator</span><span class="special">&lt;&lt;(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">Os</span><span class="special">,</span>
                 <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="comment">// comparison
 </span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
@@ -118,11 +118,11 @@
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
@@ -130,23 +130,23 @@
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                     <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="comment">// external construction
 </span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
+ <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
                          <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -154,23 +154,23 @@
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
+ <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
+
     <span class="comment">// convenience
 </span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
 <span class="special">}</span> <span class="comment">// namespace 'boost'
 </span></pre>
 <p>
@@ -269,10 +269,10 @@
           </p>
 </blockquote></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">iterator_range</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
                                     <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
 </pre>
 <p>
@@ -287,7 +287,7 @@
           </p>
 </blockquote></div>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">new_begin</span> <span class="special">=</span> <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">),</span>
 <span class="identifier">iterator</span> <span class="identifier">new_end</span> <span class="special">=</span> <span class="identifier">end</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/join.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/join.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -43,7 +43,7 @@
           <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
         </h5>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</span><span class="special">&lt;</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -39,53 +39,53 @@
           <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
         </h5>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="keyword">class</span> <span class="identifier">sub_range</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">public</span><span class="special">:</span>
         <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">iterator</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">const_iterator</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-
+
     <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
 </span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
 
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
- <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
+ <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
 </span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">();</span>
         <span class="identifier">const_iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">();</span>
- <span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
+ <span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
 </span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">();</span>
         <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">();</span>
         <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
+ <span class="comment">// for Random Access Range only:
 </span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
         <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
+
     <span class="keyword">public</span><span class="special">:</span>
         <span class="comment">// rest of interface inherited from iterator_range
 </span> <span class="special">};</span>
-
+
 <span class="special">}</span> <span class="comment">// namespace 'boost'
 </span></pre>
 <p>
@@ -98,7 +98,7 @@
           <code class="computeroutput"><span class="identifier">sub_range</span></code>
         </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"hello"</span><span class="special">);</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">ir</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/style_guide.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/style_guide.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -105,7 +105,7 @@
       must be exactly defined. The iterator-based version looks like this:
     </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="special">&gt;</span>
 <span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">first</span><span class="special">,</span>
@@ -117,7 +117,7 @@
       For ranges the interface becomes
     </p>
 <p>
-
+
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessReadableWritableRange</span> <span class="special">&gt;</span>
 <span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessReadableWritableRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html (from r80716, /website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_44_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_44_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_44_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_44_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -239,10 +239,10 @@
         Abrahams.</li>
     <li>random - A complete
         system for random number generation, from Jens Maurer.</li>
- <li>range - Concepts and utilities for
- range-based algorithms, as well as range-based algorithms and range
- adaptors that allow for efficient and very expressive code, from
- Thorsten Ottosen and Neil Groves.</li>
+ <li>range - Concepts and utilities for
+ range-based algorithms, as well as range-based algorithms and range
+ adaptors that allow for efficient and very expressive code, from
+ Thorsten Ottosen and Neil Groves.</li>
     <li>rational - A rational
         number class, from Paul Moore.</li>
 

Copied: website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v2/doc/index.htm (from r80716, /website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v2/doc/index.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v2/doc/index.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v2/doc/index.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -73,22 +73,22 @@
     <tr>
       <td>
       <p align="center"><b>This is Version 2 of the Filesystem library.</b></p>
- <p align="center">Version 3, a major revision with many new and improved
- features, is also available. Version 3 may break some user code written
+ <p align="center">Version 3, a major revision with many new and improved
+ features, is also available. Version 3 may break some user code written
       for Version 2.</p>
- <p align="center">To ease the transition, Boost releases 1.44 through 1.47
- will supply both V2 and V3. Version 2 is the default version for Boost release 1.44
+ <p align="center">To ease the transition, Boost releases 1.44 through 1.47
+ will supply both V2 and V3. Version 2 is the default version for Boost release 1.44
       and 1.45. Version 3 will be the default starting with release 1.46.</p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 3 to use Version 3. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 3</code>.
+ <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 3 to use Version 3. You may do this via a
+ compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 3</code>.
       This will be the default for release 1.46 and later.</b></p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 2 to use Version
- 2. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 2</code>.
+ <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 2 to use Version
+ 2. You may do this via a
+ compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 2</code>.
       This is the default for release 1.44 and 1.45.</b></p>
- <p align="center">Existing code should be moved to version 3 as soon as
+ <p align="center">Existing code should be moved to version 3 as soon as
       convenient. New code should be written for version 3.</p>
- <p align="center">Version 2 is deprecated, and will not be included in Boost
+ <p align="center">Version 2 is deprecated, and will not be included in Boost
       releases 1.48 and later.</p>
       </td>
     </tr>
@@ -97,30 +97,30 @@
 </div>
 
 <h2><a name="Introduction">Introduction</a></h2>
-<p>The Boost.Filesystem library provides portable facilities to query and
+<p>The Boost.Filesystem library provides portable facilities to query and
 manipulate paths, files, and directories.</p>
 
-<p>The motivation for the library is the need to perform portable script-like operations from within C++ programs. The intent is not to
-compete with Python, Perl, or shell languages, but rather to provide portable filesystem
+<p>The motivation for the library is the need to perform portable script-like operations from within C++ programs. The intent is not to
+compete with Python, Perl, or shell languages, but rather to provide portable filesystem
 operations when C++ is already the language of choice. The <a href="design.htm">
 design</a> encourages, but does not require, safe and portable usage.</p>
 
-<p>Programs using the library are <b><i>portable</i></b>, both in the sense that
-the syntax of program code is portable, and the sense that the semantics or
-behavior of code is portable. The <a href="reference.html">generic path
+<p>Programs using the library are <b><i>portable</i></b>, both in the sense that
+the syntax of program code is portable, and the sense that the semantics or
+behavior of code is portable. The <a href="reference.html">generic path
 grammar</a> is another important aid to portability.</p>
 
-<p>Usage is <i><b>safe</b></i> in the sense that errors cannot be ignored since most functions throw C++
-exceptions when errors are detected. This is also convenient for users because
-it alleviates the&nbsp;need to explicitly check error
+<p>Usage is <i><b>safe</b></i> in the sense that errors cannot be ignored since most functions throw C++
+exceptions when errors are detected. This is also convenient for users because
+it alleviates the&nbsp;need to explicitly check error
 return codes.</p>
 
 <p>A proposal,
 <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1975.html">
-N1975</a>, to include Boost.Filesystem in Technical Report 2 has been accepted
-by the C++ Standards Committee. The Boost.Filesystem library will stay in
-alignment with the TR2 Filesystem proposal as it works its way through the TR2
-process. Note, however, that namespaces and header granularity differs between
+N1975</a>, to include Boost.Filesystem in Technical Report 2 has been accepted
+by the C++ Standards Committee. The Boost.Filesystem library will stay in
+alignment with the TR2 Filesystem proposal as it works its way through the TR2
+process. Note, however, that namespaces and header granularity differs between
 Boost.Filesystem and the TR2 proposal.</p>
 
 <p>The Boost.Filesystem library provides several&nbsp; headers:</p>
@@ -129,24 +129,24 @@
   <li>Header &lt;boost/filesystem.hpp&gt; provides class <i>
   basic_path, </i>a portable mechanism for representing
       <a href="#path">paths</a> in C++ programs. Typedefs <i>path</i> and <i>
- wpath</i> ease the most common usages of <i>basic_path</i>. Operational
- functions provide useful query and maintenance operations on files and directories.
+ wpath</i> ease the most common usages of <i>basic_path</i>. Operational
+ functions provide useful query and maintenance operations on files and directories.
   Class <i>basic_directory_iterator</i> with typdefs <i>
- directory_iterator</i> and <i>wdirectory_iterator</i> provide iteration over
- the contents of directories. Convenience functions and classes combine lower-level functionality
+ directory_iterator</i> and <i>wdirectory_iterator</i> provide iteration over
+ the contents of directories. Convenience functions and classes combine lower-level functionality
   in useful ways.<br>
 &nbsp;</li>
- <li>Header &lt;boost/filesystem/fstream.hpp&gt; provides the same components as the C++ Standard
- Library's <i>fstream</i> header, except
+ <li>Header &lt;boost/filesystem/fstream.hpp&gt; provides the same components as the C++ Standard
+ Library's <i>fstream</i> header, except
       that files are identified by <i>basic_path</i> objects rather that <i>char *</i>'s.</li>
 </ul>
 <h2><a name="Using">Using</a> the library</h2>
-<p>Boost.Filesystem is implemented as a separately compiled library, so before
+<p>Boost.Filesystem is implemented as a separately compiled library, so before
 using it you must install it in a location that can be found by your linker. See
 <a href="#Building">Building the object-library</a>. </p>
-<p>The library's example directory contains very simple
-scripts for building the example programs on various
-platforms. You can use these scripts to see what's needed to compile and link
+<p>The library's example directory contains very simple
+scripts for building the example programs on various
+platforms. You can use these scripts to see what's needed to compile and link
 your own programs.</p>
 <h2>Two-minute <a name="tutorial">tutorial</a></h2>
 <p>(A
@@ -164,18 +164,18 @@
   <pre>path my_path( &quot;some_dir/file.txt&quot; );</pre>
 </blockquote>
 <p>The string passed to the <i>path</i> constructor may be in a
-portable generic path format or an
-implementation-defined native operating system format. Access functions
-make <i>my_path</i> contents available to the underlying operating system API in an operating system dependent format,
+portable generic path format or an
+implementation-defined native operating system format. Access functions
+make <i>my_path</i> contents available to the underlying operating system API in an operating system dependent format,
 such as <code>&quot;some_dir:file.txt&quot;</code>, <code>&quot;[some_dir]file.txt&quot;</code>,
-<code>&quot;some_dir/file.txt&quot;</code>, or whatever is appropriate for the
-operating system. If class <i>wpath</i> is used instead of class <i>path</i>,
-translation between wide and narrow character paths is performed automatically
+<code>&quot;some_dir/file.txt&quot;</code>, or whatever is appropriate for the
+operating system. If class <i>wpath</i> is used instead of class <i>path</i>,
+translation between wide and narrow character paths is performed automatically
 if necessary for the operating system.</p>
 <p>Class <i>path</i> has conversion constructors from <i>const char*</i> and <i>
-const std:: string&amp;</i>, so that even though the Filesystem Library
-functions used in the following code snippet have <i>const path&amp;</i> formal
-parameters, the user can just
+const std:: string&amp;</i>, so that even though the Filesystem Library
+functions used in the following code snippet have <i>const path&amp;</i> formal
+parameters, the user can just
 code C-style strings as actual arguments:</p>
 <blockquote>
   <pre>remove_all( &quot;foobar&quot; );
@@ -186,25 +186,25 @@
 if ( !exists( &quot;foobar/cheeze&quot; ) )
   std::cout &lt;&lt; &quot;Something is rotten in foobar\n&quot;;</pre>
 </blockquote>
-<p>To make class <i>path</i> objects easy to use in expressions, <i>operator/</i>
+<p>To make class <i>path</i> objects easy to use in expressions, <i>operator/</i>
 appends paths:</p>
 <blockquote>
   <pre>ifstream file1( arg_path / &quot;foo/bar&quot; );
 ifstream file2( arg_path / &quot;foo&quot; / &quot;bar&quot; );</pre>
 </blockquote>
-<p>The expressions <i>arg_path / &quot;foo/bar&quot;</i> and <i>arg_path / &quot;foo&quot;
+<p>The expressions <i>arg_path / &quot;foo/bar&quot;</i> and <i>arg_path / &quot;foo&quot;
 / &quot;bar&quot;</i> yield identical results.</p>
-<p>Paths can include references to the current directory, using &quot;<code>.</code>&quot;
-notation, and the parent directory, using &quot;<code>..</code>&quot;
+<p>Paths can include references to the current directory, using &quot;<code>.</code>&quot;
+notation, and the parent directory, using &quot;<code>..</code>&quot;
 notation.</p>
-<p>Class basic_directory_iterator
-is an important component of the library. It provides an input iterator over the
-contents of a directory, with the value type being class <i>basic_path</i>.
-Typedefs <i>directory_iterator</i> and <i>wdirectory_iterator</i> are provided
+<p>Class basic_directory_iterator
+is an important component of the library. It provides an input iterator over the
+contents of a directory, with the value type being class <i>basic_path</i>.
+Typedefs <i>directory_iterator</i> and <i>wdirectory_iterator</i> are provided
 to cover the most common use cases.</p>
-<p>The following function, given a directory path and a file name, recursively
-searches the directory and its sub-directories for the file name, returning a
-bool, and if successful, the path to the file that was found.&nbsp; The code
+<p>The following function, given a directory path and a file name, recursively
+searches the directory and its sub-directories for the file name, returning a
+bool, and if successful, the path to the file that was found.&nbsp; The code
 below is extracted from a real program, slightly modified for clarity:</p>
 <blockquote>
   <pre>bool find_file( const path &amp; dir_path, // in this directory,
@@ -230,101 +230,101 @@
   return false;
 }</pre>
 </blockquote>
-<p>The expression <i>itr-&gt;path().filename() == file_name</i>, in the line commented <i>//
-see below</i>, calls the <i>filename()</i> function on the <i>path</i> returned by
-calling the <i>path()</i> function of the <i>directory_entry </i>object pointed
-to by the iterator. <i>filename()</i> returns a string which is a copy of the
+<p>The expression <i>itr-&gt;path().filename() == file_name</i>, in the line commented <i>//
+see below</i>, calls the <i>filename()</i> function on the <i>path</i> returned by
+calling the <i>path()</i> function of the <i>directory_entry </i>object pointed
+to by the iterator. <i>filename()</i> returns a string which is a copy of the
 last (closest to the leaf, farthest from the root) file or directory name in the
 <i>path</i> object.</p>
-<p>Notice that <i>find_file()</i> does not do explicit error checking, such as
-verifying that the <i>dir_path</i> argument really represents a directory.
-Boost.Filesystem functions throw
-exceptions if they do not complete successfully, so there is enough implicit
-error checking that this application doesn't need to supply additional error
-checking code unless desired. Several Boost.Filesystem functions have non-throwing
+<p>Notice that <i>find_file()</i> does not do explicit error checking, such as
+verifying that the <i>dir_path</i> argument really represents a directory.
+Boost.Filesystem functions throw
+exceptions if they do not complete successfully, so there is enough implicit
+error checking that this application doesn't need to supply additional error
+checking code unless desired. Several Boost.Filesystem functions have non-throwing
 versions, to ease use cases where exceptions would not be appropriate.</p>
 <blockquote>
-<p><i>Note: </i>Recursive
-directory iteration was added as a convenience function after the above tutorial code
-was written, so nowadays you
+<p><i>Note: </i>Recursive
+directory iteration was added as a convenience function after the above tutorial code
+was written, so nowadays you
 don't have to actually code the recursion yourself.</p>
 </blockquote>
 <h2><a name="Cautions">Cautions</a></h2>
-<p>After reading the tutorial you can dive right into simple,
-script-like programs using the Filesystem Library! Before doing any serious
+<p>After reading the tutorial you can dive right into simple,
+script-like programs using the Filesystem Library! Before doing any serious
 work, however, there a few cautions to be aware of:</p>
 <h4><b>Effects and Postconditions not guaranteed in the presence of race-conditions</b></h4>
-<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
-effects and postconditions. If
-a race-condition exists, a function's
-postconditions may no longer be true by the time the function returns to the
+<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
+effects and postconditions. If
+a race-condition exists, a function's
+postconditions may no longer be true by the time the function returns to the
 caller.</p>
 <blockquote>
 <p><b><i>Explanation: </i></b>The state of files and directories is often
-globally shared, and thus may be changed unexpectedly by other threads,
-processes, or even other computers having network access to the filesystem. As an
-example of the difficulties this can cause, note that the following asserts
+globally shared, and thus may be changed unexpectedly by other threads,
+processes, or even other computers having network access to the filesystem. As an
+example of the difficulties this can cause, note that the following asserts
 may fail:</p>
 <blockquote>
-<p><code>assert( exists( &quot;foo&quot; ) == exists( &quot;foo&quot; ) );&nbsp; //
+<p><code>assert( exists( &quot;foo&quot; ) == exists( &quot;foo&quot; ) );&nbsp; //
 (1)<br>
 <br>
 remove_all( &quot;foo&quot; );<br>
 assert( !exists( &quot;foo&quot; ) );&nbsp; // (2)<br>
 <br>
-assert( is_directory( &quot;foo&quot; ) == is_directory( &quot;foo&quot; ) ); //
+assert( is_directory( &quot;foo&quot; ) == is_directory( &quot;foo&quot; ) ); //
 (3)</code></p>
 </blockquote>
-<p>(1) will fail if a non-existent &quot;foo&quot; comes into existence, or an
-existent &quot;foo&quot; is removed, between the first and second call to <i>exists()</i>.
-This could happen if, during the execution of the example code, another thread,
+<p>(1) will fail if a non-existent &quot;foo&quot; comes into existence, or an
+existent &quot;foo&quot; is removed, between the first and second call to <i>exists()</i>.
+This could happen if, during the execution of the example code, another thread,
 process, or computer is also performing operations in the same directory.</p>
 <p>(2) will fail if between the call to <i>remove_all()</i> and the call to
-<i>exists()</i> a new file or directory named &quot;foo&quot; is created by another
+<i>exists()</i> a new file or directory named &quot;foo&quot; is created by another
 thread, process, or computer.</p>
-<p>(3) will fail if another thread, process, or computer removes an
-existing file &quot;foo&quot; and then creates a directory named &quot;foo&quot;, between the
+<p>(3) will fail if another thread, process, or computer removes an
+existing file &quot;foo&quot; and then creates a directory named &quot;foo&quot;, between the
 example code's two calls to <i>is_directory()</i>.</p>
 </blockquote>
 <h4><b>May throw exceptions</b></h4>
 <p>Unless otherwise specified, Boost.Filesystem functions throw <i>
-basic_filesystem_error</i>
-exceptions if they cannot successfully complete their operational
-specifications. Also, implementations may use C++ Standard Library functions,
-which may throw <i>std::bad_alloc</i>. These exceptions may be thrown even
-though the error condition leading to the exception is not explicitly specified
+basic_filesystem_error</i>
+exceptions if they cannot successfully complete their operational
+specifications. Also, implementations may use C++ Standard Library functions,
+which may throw <i>std::bad_alloc</i>. These exceptions may be thrown even
+though the error condition leading to the exception is not explicitly specified
 in the function's &quot;Throws&quot; paragraph.</p>
-<p>All exceptions thrown by the Filesystem
+<p>All exceptions thrown by the Filesystem
 Library are implemented by calling <a href="../../../utility/throw_exception.html">
-boost::throw_exception()</a>. Thus exact behavior may differ depending on
+boost::throw_exception()</a>. Thus exact behavior may differ depending on
 BOOST_NO_EXCEPTIONS at the time the filesystem source files are compiled.</p>
-<p>Non-throwing versions are provided of several functions that are often used
+<p>Non-throwing versions are provided of several functions that are often used
 in contexts where error codes may be the preferred way to report an error.</p>
 <h2><a name="Examples">Example programs</a></h2>
 <h3>simple_ls.cpp</h3>
-<p>The example program simple_ls.cpp is
-given a path as a command line argument. Since the command line argument may be
-a relative path, the complete path is determined so that messages displayed
+<p>The example program simple_ls.cpp is
+given a path as a command line argument. Since the command line argument may be
+a relative path, the complete path is determined so that messages displayed
 can be more precise.</p>
 <p>The program checks to see if the path exists; if not a message is printed.</p>
-<p>If the path identifies a directory, the directory is iterated through,
-printing the name of the entries found, and an indication if they are
-directories. A count of directories and files is updated, and then printed after
+<p>If the path identifies a directory, the directory is iterated through,
+printing the name of the entries found, and an indication if they are
+directories. A count of directories and files is updated, and then printed after
 the iteration is complete.</p>
 <p>If the path is for a file, a message indicating that is printed.</p>
-<p>Try compiling and executing simple_ls.cpp
-to see how it works on your system. Try various path arguments to see what
+<p>Try compiling and executing simple_ls.cpp
+to see how it works on your system. Try various path arguments to see what
 happens.</p>
 <h3>file_size.cpp</h3>
 <p>This example program prints the file's size if it is a regular file.</p>
 <h3>Other examples</h3>
-<p>The programs used to generate the Boost regression test status tables use the
+<p>The programs used to generate the Boost regression test status tables use the
 Filesystem Library extensively.&nbsp; See:</p>
 <ul>
   <li>process_jam_log.cpp</li>
   <li>compiler_status.cpp</li>
 </ul>
-<p>Test programs are sometimes useful in understanding a library, as they
+<p>Test programs are sometimes useful in understanding a library, as they
 illustrate what the developer expected to work and not work. See:</p>
 <ul>
   <li>wide_test.cpp</li>
@@ -333,13 +333,13 @@
   <li>fstream_test.cpp</li>
 </ul>
 <h2><a name="Implementation">Implementation</a></h2>
-<p>The current implementation supports operating systems which provide
+<p>The current implementation supports operating systems which provide
 either the POSIX or Windows API.</p>
-<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
-Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
+<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
+Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
 of compilers.</p>
 <h2><a name="Macros">Macros</a></h2>
-<p>Users may defined the following macros if desired. Sensible defaults are
+<p>Users may defined the following macros if desired. Sensible defaults are
 provided, so users can ignore these macros unless they have special needs.</p>
 <table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
   <tr>
@@ -349,16 +349,16 @@
   </tr>
   <tr>
     <td valign="top"><code>BOOST_FILESYSTEM_DYN_LINK</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
+ <td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
     otherwise not defined.</td>
- <td valign="top">Boost.System library is dynamically linked. If not defined,
+ <td valign="top">Boost.System library is dynamically linked. If not defined,
     static linking is assumed.</td>
   </tr>
   <tr>
     <td valign="top"><code>BOOST_FILESYSTEM_NO_LIB</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
+ <td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
     otherwise not defined.</td>
- <td valign="top">Boost.System library does not use the Boost auto-link
+ <td valign="top">Boost.System library does not use the Boost auto-link
     facility.</td>
   </tr>
   <tr>
@@ -373,10 +373,10 @@
   </tr>
 </table>
 <h2><a name="Deprecated-names">Deprecated names</a> and features</h2>
-<p style="font-size: 10pt">User-defined BOOST_POSIX_API and BOOST_WINDOWS_API
+<p style="font-size: 10pt">User-defined BOOST_POSIX_API and BOOST_WINDOWS_API
 macros are no longer supported.</p>
-<p style="font-size: 10pt">As the library evolves over time, names sometimes
-change or features are removed. To ease transition, Boost.Filesystem deprecates
+<p style="font-size: 10pt">As the library evolves over time, names sometimes
+change or features are removed. To ease transition, Boost.Filesystem deprecates
 the old names and features, but continues to provide them unless macro <code>
 BOOST_FILESYSTEM_NO_DEPRECATED</code> is defined.</p>
 <table border="1" cellpadding="5" cellspacing="1" style="border-collapse: collapse" bordercolor="#111111">
@@ -532,46 +532,46 @@
   </tr>
 </table>
 <h2><a name="narrow-only">Restricting library to narrow character paths</a></h2>
-<p>Compilers or standard libraries which do not support wide characters (wchar_t)
-or wide character strings (std::wstring) are detected automatically, and cause
-the library to compile code that is restricted to narrow character paths
-(boost::filesystem::path). Users can force this restriction by defining the
-macro BOOST_FILESYSTEM_NARROW_ONLY. That may be useful for dealing with legacy
+<p>Compilers or standard libraries which do not support wide characters (wchar_t)
+or wide character strings (std::wstring) are detected automatically, and cause
+the library to compile code that is restricted to narrow character paths
+(boost::filesystem::path). Users can force this restriction by defining the
+macro BOOST_FILESYSTEM_NARROW_ONLY. That may be useful for dealing with legacy
 compilers or operating systems.</p>
 <h2><a name="Building">Building</a> the object-library</h2>
-<p>The object-library will be built automatically if you are using the Boost
+<p>The object-library will be built automatically if you are using the Boost
 build system. See
-Getting Started. It can also be
-built manually using a Jamfile
-supplied in directory libs/filesystem/build, or the user can construct an IDE
+Getting Started. It can also be
+built manually using a Jamfile
+supplied in directory libs/filesystem/build, or the user can construct an IDE
 project or make file which includes the object-library source files.</p>
-<p>The object-library source files are
-supplied in directory libs/filesystem/src. These source files implement the
-library for POSIX or Windows compatible operating systems; no implementation is
-supplied for other operating systems. Note that many operating systems not
-normally thought of as POSIX systems, such as mainframe legacy
-operating systems or embedded operating systems, support POSIX compatible file
+<p>The object-library source files are
+supplied in directory libs/filesystem/src. These source files implement the
+library for POSIX or Windows compatible operating systems; no implementation is
+supplied for other operating systems. Note that many operating systems not
+normally thought of as POSIX systems, such as mainframe legacy
+operating systems or embedded operating systems, support POSIX compatible file
 systems which will work with the Filesystem Library.</p>
-<p>The object-library can be built for static or dynamic (shared/dll) linking.
-This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
+<p>The object-library can be built for static or dynamic (shared/dll) linking.
+This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
 macros. See the <a href="http://www.boost.org/development/separate_compilation.html">Separate
 Compilation</a> page for a description of the techniques used.</p>
 <h3>Note for <a name="Cgywin">Cygwin</a> users</h3>
-<p>The library's implementation code treats Cygwin
+<p>The library's implementation code treats Cygwin
 as a Windows platform, and thus uses the Windows API.</p>
 <h2><a name="Acknowledgements">Acknowledgements</a></h2>
-<p>The Filesystem Library was designed and implemented by Beman Dawes. The
-original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
-based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
-was a particular help in later stages of initial development. Peter Dimov and
-Rob Stewart made many useful suggestions and comments over a long period of
+<p>The Filesystem Library was designed and implemented by Beman Dawes. The
+original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
+based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
+was a particular help in later stages of initial development. Peter Dimov and
+Rob Stewart made many useful suggestions and comments over a long period of
 time. Howard Hinnant helped with internationalization issues.</p>
 
 <p>Key design requirements and
-design realities were developed during
-extensive discussions on the Boost mailing list, followed by comments on the
-initial implementation. Numerous helpful comments were then received during the
-Formal Review.<p>Participants included
+design realities were developed during
+extensive discussions on the Boost mailing list, followed by comments on the
+initial implementation. Numerous helpful comments were then received during the
+Formal Review.<p>Participants included
 Aaron Brashears,
 Alan Bellingham,
 Aleksey Gurtovoy,
@@ -579,62 +579,62 @@
 Alisdair Meredith,
 Andy Glew,
 Anthony Williams,
-Baptiste Lepilleur,
+Baptiste Lepilleur,
 Beman Dawes,
 Bill Kempf,
-Bill Seymour,
+Bill Seymour,
 Carl Daniel,
 Chris Little,
 Chuck Allison,
-Craig Henderson,
+Craig Henderson,
 Dan Nuffer,
 Dan'l Miller,
-Daniel Frey,
-Darin Adler,
+Daniel Frey,
+Darin Adler,
 David Abrahams,
-David Held,
+David Held,
 Davlet Panech,
 Dietmar Kuehl,
-Douglas Gregor,
+Douglas Gregor,
 Dylan Nicholson,
-Ed Brey,
+Ed Brey,
 Eric Jensen,
 Eric Woodruff,
 Fedder Skovgaard,
 Gary Powell,
 Gennaro Prota,
-Geoff Leyland,
-George Heintzelman,
+Geoff Leyland,
+George Heintzelman,
 Giovanni Bajo,
 Glen Knowles,
 Hillel Sims,
 Howard Hinnant,
 Jaap Suter,
-James Dennett,
-Jan Langer,
-Jani Kajala,
-Jason Stewart,
+James Dennett,
+Jan Langer,
+Jani Kajala,
+Jason Stewart,
 Jeff Garland,
 Jens Maurer,
 Jesse Jones,
 Jim Hyslop,
 Joel de Guzman,
 Joel Young,
-John Levon,
+John Levon,
 John Maddock,
 John Williston,
 Jonathan Caves,
 Jonathan Biggar,
 Jurko,
 Justus Schwartz,
-Keith Burton,
+Keith Burton,
 Ken Hagen,
-Kostya Altukhov,
+Kostya Altukhov,
 Mark Rodgers,
-Martin Schuerch,
+Martin Schuerch,
 Matt Austern,
-Matthias Troyer,
-Mattias Flodin,
+Matthias Troyer,
+Mattias Flodin,
 Michiel Salters,
 Mickael Pointier,
 Misha Bergal,
@@ -642,7 +642,7 @@
 Noel Yap,
 Parksie,
 Patrick Hartling, Pavel Vozenilek,
-Pete Becker,
+Pete Becker,
 Peter Dimov,
 Rainer Deyke,
 Rene Rivera,
@@ -651,28 +651,28 @@
 Ron Garcia,
 Ross Smith,
 Sashan,
-Steve Robbins,
-Thomas Witt,
-Tom Harris,
+Steve Robbins,
+Thomas Witt,
+Tom Harris,
 Toon Knapen,
 Victor Wagner,
 Vincent Finn,
 Vladimir Prus, and
 Yitzhak Sapir
-
-<p>A lengthy discussion on the C++ committee's library reflector illuminated the &quot;illusion
+
+<p>A lengthy discussion on the C++ committee's library reflector illuminated the &quot;illusion
 of portability&quot; problem, particularly in postings by PJ Plauger and Pete Becker.</p>
 
-<p>Walter Landry provided much help illuminating symbolic link use cases for
+<p>Walter Landry provided much help illuminating symbolic link use cases for
 version 1.31.0.</p>
 
 <h3>Version 1.34 (i18n) acknowledgements</h3>
 
-<p>So many people have contributed comments and bug reports that it isn't any
-longer possible to acknowledge them individually. That said, Peter Dimov and Rob
-Stewart need to be specially thanked for their many constructive criticisms and
-suggestions. Terence
-Wilson and Chris Frey contributed timing programs which helped illuminate
+<p>So many people have contributed comments and bug reports that it isn't any
+longer possible to acknowledge them individually. That said, Peter Dimov and Rob
+Stewart need to be specially thanked for their many constructive criticisms and
+suggestions. Terence
+Wilson and Chris Frey contributed timing programs which helped illuminate
 performance issues.</p>
 
 <h2><a name="Change-history">Change history</a></h2>
@@ -680,14 +680,14 @@
 <h3>Version 1.37.0</h3>
 
 <ul>
- <li>Doc fixes: Update release history, add tables of macros and deprecated
+ <li>Doc fixes: Update release history, add tables of macros and deprecated
   names.</li>
- <li>Bug fix: convenience.hpp didn't fully apply BOOST_FILESYSTEM_NO_DEPRECATED
+ <li>Bug fix: convenience.hpp didn't fully apply BOOST_FILESYSTEM_NO_DEPRECATED
   to name changes.</li>
   <li>Bug fix: Ticket #1972 'remove' fixes.</li>
- <li>Bug fix: Restore deprecated basic_directory_entry names inadvertently
+ <li>Bug fix: Restore deprecated basic_directory_entry names inadvertently
   removed.</li>
- <li>Bug fix: Provide deprecated functions has_branch_path and has_leaf,
+ <li>Bug fix: Provide deprecated functions has_branch_path and has_leaf,
   inadvertently omitted from 1.36.0</li>
   <li>Add workarounds for Codegear/Borland C++ Builder 2009.</li>
 </ul>
@@ -695,8 +695,8 @@
 <h3>Version 1.36.0 - August 14th, 2008</h3>
 
 <ul>
- <li>Added stem(), extension(), and replace_extension() member functions to
- basic_path, based on the basename(), extension(), and change_extension()
+ <li>Added stem(), extension(), and replace_extension() member functions to
+ basic_path, based on the basename(), extension(), and change_extension()
   functions from convenience.hpp.</li>
   <li>Changed path.hpp function names:<ul>
     <li>leaf() -&gt; filename().</li>
@@ -729,31 +729,31 @@
 <h3>Version 1.34.0 - May 12th, 2007</h3>
 
 <ul>
- <li>Internationalization, provided by
+ <li>Internationalization, provided by
   class templates <i>basic_path</i>, <i>basic_filesystem_error</i>, and <i>
   basic_directory_iterator</i>.</li>
- <li>Simplification of the path interface,
- including elimination of distinction between native and generic formats,
+ <li>Simplification of the path interface,
+ including elimination of distinction between native and generic formats,
   and separation of name checking functionality from general path functionality.</li>
- <li>Rationalization of predicate
+ <li>Rationalization of predicate
   function design, including the addition of several new functions.</li>
- <li>Preservation of existing user code whenever
- possible. Deprecated features (<i>symbolic_link_exists()</i>, etc.) remain
+ <li>Preservation of existing user code whenever
+ possible. Deprecated features (<i>symbolic_link_exists()</i>, etc.) remain
   available for legacy code.</li>
- <li>Clearer specification, by reference to [POSIX-01],
- the ISO/IEEE Single Unix Standard, with provisions for Windows and other
+ <li>Clearer specification, by reference to [POSIX-01],
+ the ISO/IEEE Single Unix Standard, with provisions for Windows and other
   operating systems.</li>
   <li>New functions status,
   <a href="reference.html#Status-functions">symlink_status</a>,
   <a href="reference.html#Predicate-functions">is_file</a>,
   <a href="reference.html#Predicate-functions">is_symlink</a>,
- create_hard_link,
- create_symlink, path member and non-member swap, path inserter, path
- extractor, additional path relational and &quot;/&quot; operator overloads, additional
+ create_hard_link,
+ create_symlink, path member and non-member swap, path inserter, path
+ extractor, additional path relational and &quot;/&quot; operator overloads, additional
   path member template functions taking iterator arguments.</li>
   <li>More efficient operations when iterating over directories.</li>
- <li>Separation within the implementation of the distinction between the native
- operating system path syntax and API. This is important for CYGWIN users
+ <li>Separation within the implementation of the distinction between the native
+ operating system path syntax and API. This is important for CYGWIN users
   because it allows them to build for either the Windows or POSIX API's.</li>
   <li>Numerous small implementation fixes.</li>
 </ul>
@@ -770,31 +770,31 @@
   <li>file_size() function added.</li>
   <li>Class path relational operators added.</li>
   <li>equivalent() function added.</li>
- <li>create_directory() no longer
- throws if the directory already exists. A bool is returned, indicating that
+ <li>create_directory() no longer
+ throws if the directory already exists. A bool is returned, indicating that
   the directory did not preexist. Similar changes made to
   <a href="reference.html#Convenience-functions">create_directories()</a>.</li>
- <li>Docs added for users wishing Cygwin/POSIX behavior
+ <li>Docs added for users wishing Cygwin/POSIX behavior
   on Windows.</li>
- <li>For POSIX, Large File Support (LSF) is enabled if available, such as on
+ <li>For POSIX, Large File Support (LSF) is enabled if available, such as on
   Linux.</li>
   <li>current_path() and
- initial_path() on POSIX now handle
+ initial_path() on POSIX now handle
   very long paths correctly.</li>
 </ul>
 
 <h3>Version 1.31.0 - January 26th, 2004</h3>
 
 <ul>
- <li>The object library can now be built for either
+ <li>The object library can now be built for either
   static or dynamic (shared/dll) linking. </li>
- <li>Several added functions, including improved checking for directory and
+ <li>Several added functions, including improved checking for directory and
   file name portability. See <a href="portability_guide.htm#name_check_functions">
   Name check functions</a>.</li>
- <li>Separation of canonical form and normalized form and a new path member
- function normalize(). This changes behavior,
+ <li>Separation of canonical form and normalized form and a new path member
+ function normalize(). This changes behavior,
   in that canonical form is now different, but eliminates a subtle
- bug when symbolic links to
+ bug when symbolic links to
   directories are present.</li>
 </ul>
 
@@ -809,7 +809,7 @@
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->21 June, 2010<!--webbot bot="Timestamp" endspan i-checksum="19840" --></p>
 
 <p>&copy; Copyright Beman Dawes, 2002-2005</p>
-<p> Use, modification, and distribution are subject to the Boost Software
+<p> Use, modification, and distribution are subject to the Boost Software
 License, Version 1.0. See <a href="http://www.boost.org/LICENSE_1_0.txt">
 www.boost.org/LICENSE_1_0.txt</a></p>
 

Copied: website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v3/doc/index.htm (from r80716, /website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v3/doc/index.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v3/doc/index.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_45_0/libs/filesystem/v3/doc/index.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -67,22 +67,22 @@
     <tr>
       <td>
       <p align="center"><b>This is the home page for Version 3 of the Filesystem library.</b></p>
- <p align="center">Version 3 is a major revision with many new and improved
+ <p align="center">Version 3 is a major revision with many new and improved
       features. It may, however, break some user code written for Version 2.</p>
- <p align="center">To ease the transition, Boost releases 1.44 through 1.47
- will supply both V2 and V3. Version 2
- is the default version for Boost release 1.44
+ <p align="center">To ease the transition, Boost releases 1.44 through 1.47
+ will supply both V2 and V3. Version 2
+ is the default version for Boost release 1.44
       and 1.45. Version 3 will be the default starting with release 1.46.</p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 3 to use Version 3. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 3</code>.
+ <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 3 to use Version 3. You may do this via a
+ compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 3</code>.
       This will be the default for release 1.46 and later.</b></p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 2 to use Version
- 2. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 2</code>.
+ <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 2 to use Version
+ 2. You may do this via a
+ compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 2</code>.
       This is the default for release 1.44 and 1.45.</b></p>
- <p align="center">Existing code should be moved to Version 3 as soon as
+ <p align="center">Existing code should be moved to Version 3 as soon as
       convenient. New code should be written for Version 3.</p>
- <p align="center">Version 2 is deprecated, and will not be included in Boost
+ <p align="center">Version 2 is deprecated, and will not be included in Boost
       releases 1.48 and later.</p>
       </td>
     </tr>
@@ -91,21 +91,21 @@
 </div>
 
 <h2><a name="Introduction">Introduction</a></h2>
-<p>The Boost.Filesystem library provides facilities to manipulate files and directories,
+<p>The Boost.Filesystem library provides facilities to manipulate files and directories,
 and the paths that identify them.</p>
 
 <p>The features of the library include:</p>
 
 <ul>
- <li><b>A modern C++ interface, highly compatible with the C++ standard
+ <li><b>A modern C++ interface, highly compatible with the C++ standard
   library.</b></li>
 </ul>
 <blockquote>
   <blockquote>
 
-<p>Many users say the interface is their primary motivation for using
-Boost.Filesystem. They like its use of familiar idioms based on standard library
-containers, iterators, and algorithms. They like having errors reported by
+<p>Many users say the interface is their primary motivation for using
+Boost.Filesystem. They like its use of familiar idioms based on standard library
+containers, iterators, and algorithms. They like having errors reported by
 throwing exceptions.</p>
 
   </blockquote>
@@ -113,36 +113,36 @@
 <ul>
   <li><b>Portability between operating systems.</b><br>
 &nbsp;<ul>
- <li>At the C++ syntax level, it is convenient to learn and use one interface
+ <li>At the C++ syntax level, it is convenient to learn and use one interface
     regardless of the operating system.</li>
- <li>At the semantic level, behavior of code is reasonably portable across
+ <li>At the semantic level, behavior of code is reasonably portable across
     operating systems.</li>
- <li>Dual generic or native path format support encourages program
- portability, yet still allows communication with users in system specific
+ <li>Dual generic or native path format support encourages program
+ portability, yet still allows communication with users in system specific
     formats.<br>
 &nbsp;</li>
   </ul>
   </li>
- <li><b>Error handling and reporting via C++ exceptions (the default) or error
+ <li><b>Error handling and reporting via C++ exceptions (the default) or error
   codes.</b><br>
 &nbsp;<ul>
- <li>C++ exceptions are the preferred error reporting mechanism for most
- applications. The exception thrown includes the detailed error code
+ <li>C++ exceptions are the preferred error reporting mechanism for most
+ applications. The exception thrown includes the detailed error code
     information important for diagnosing the exact cause of file system errors.</li>
- <li>Error reporting via error code allows user code that provides detailed
- error recovery to avoid becoming so littered with try-catch blocks as to be
+ <li>Error reporting via error code allows user code that provides detailed
+ error recovery to avoid becoming so littered with try-catch blocks as to be
     unmaintainable. <br>
 &nbsp;</li>
   </ul>
   </li>
- <li><b>Suitable for a broad spectrum of applications, ranging from simple
+ <li><b>Suitable for a broad spectrum of applications, ranging from simple
   script-like operations to extremely complex production code.</b><br>
 &nbsp;<ul>
- <li>At the simple script-like end of the spectrum, the intent is not to
- compete with Python, Perl, or shell languages, but rather to provide
+ <li>At the simple script-like end of the spectrum, the intent is not to
+ compete with Python, Perl, or shell languages, but rather to provide
     filesystem operations when C++ is already the language of choice.</li>
- <li>Finer grained control over operations and error handling is available to
- support more complex applications or other cases where throwing exceptions
+ <li>Finer grained control over operations and error handling is available to
+ support more complex applications or other cases where throwing exceptions
     isn't desired.</li>
   </ul>
   </li>
@@ -150,98 +150,98 @@
 
 <p>A proposal,
 <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1975.html">
-N1975</a>, to include Boost.Filesystem in Technical Report 2 has been accepted
-by the C++ Standards Committee. That proposal was based on version 2 of
+N1975</a>, to include Boost.Filesystem in Technical Report 2 has been accepted
+by the C++ Standards Committee. That proposal was based on version 2 of
 Boost.Filesystem; presumably the final TR2 form will be based on version 3.</p>
 
 <h2><a name="Documentation">Documentation</a></h2>
 
-<p><b>Tutorial</b> - A gentle introduction to
+<p><b>Tutorial</b> - A gentle introduction to
 the library, with example programs provided for you to experiment with.</p>
 
-<p><b>Reference</b> - Formal documentation in the
-style of the C++ standard for
+<p><b>Reference</b> - Formal documentation in the
+style of the C++ standard for
 every component of the library.</p>
 
 <p><b>FAQ</b> - Frequently asked questions.</p>
 
-<p><b>Portability Guide</b> - Help for those
+<p><b>Portability Guide</b> - Help for those
 concerned with writing code to run on multiple operating systems.</p>
 
-<p><b>Deprecated Features</b> - Identifies
+<p><b>Deprecated Features</b> - Identifies
 deprecated features and their replacements.</p>
 
-<p><b>Version 3 Introduction</b> - Aimed at users of prior
+<p><b>Version 3 Introduction</b> - Aimed at users of prior
 Boost.Filesystem versions.</p>
 
-<p><b>Version 3 Design</b> - Historical document
+<p><b>Version 3 Design</b> - Historical document
 from the start of the Version 3 design process.</p>
 
-<p><b>Original Design</b> - Historical document from
+<p><b>Original Design</b> - Historical document from
 the start of the Version 1 design process.</p>
 
-<p><b>Do List</b> - Boost.Filesystem development work
+<p><b>Do List</b> - Boost.Filesystem development work
 in the pipeline.</p>
 
 <h2><a name="Using">Using</a> the library</h2>
-<p>Boost.Filesystem is implemented as a separately compiled library, so you must install
-binaries in a location that can be found by your linker. If you followed the
+<p>Boost.Filesystem is implemented as a separately compiled library, so you must install
+binaries in a location that can be found by your linker. If you followed the
 <a href="http://www.boost.org/doc/libs/release/more/getting_started/index.html">Boost Getting Started</a> instructions, that's already been done for you.</p>
 <h2><a name="Coding-guidelines">Coding guidelines</a></h2>
-<p>For new code, defining <code>BOOST_FILESYSTEM_NO_DEPRECATED</code> before
-including filesystem headers is strongly recommended. This prevents inadvertent
-use of old features, particularly legacy function names, that have been replaced
+<p>For new code, defining <code>BOOST_FILESYSTEM_NO_DEPRECATED</code> before
+including filesystem headers is strongly recommended. This prevents inadvertent
+use of old features, particularly legacy function names, that have been replaced
 and are going to go away in the future.</p>
 <h2><a name="Cautions">Cautions</a></h2>
-<p>After reading the tutorial you can dive right into simple,
-script-like programs using the Filesystem Library! Before doing any serious
+<p>After reading the tutorial you can dive right into simple,
+script-like programs using the Filesystem Library! Before doing any serious
 work, however, there a few cautions to be aware of:</p>
 <h4><b>Effects and Postconditions not guaranteed in the presence of race-conditions</b></h4>
-<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
-effects and postconditions. If
-a race-condition exists, a function's
-postconditions may no longer be true by the time the function returns to the
+<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
+effects and postconditions. If
+a race-condition exists, a function's
+postconditions may no longer be true by the time the function returns to the
 caller.</p>
 <blockquote>
 <p><b><i>Explanation: </i></b>The state of files and directories is often
-globally shared, and thus may be changed unexpectedly by other threads,
-processes, or even other computers having network access to the filesystem. As an
-example of the difficulties this can cause, note that the following asserts
+globally shared, and thus may be changed unexpectedly by other threads,
+processes, or even other computers having network access to the filesystem. As an
+example of the difficulties this can cause, note that the following asserts
 may fail:</p>
 <blockquote>
-<p><code>assert( exists( &quot;foo&quot; ) == exists( &quot;foo&quot; ) );&nbsp; //
+<p><code>assert( exists( &quot;foo&quot; ) == exists( &quot;foo&quot; ) );&nbsp; //
 (1)<br>
 <br>
 remove_all( &quot;foo&quot; );<br>
 assert( !exists( &quot;foo&quot; ) );&nbsp; // (2)<br>
 <br>
-assert( is_directory( &quot;foo&quot; ) == is_directory( &quot;foo&quot; ) ); //
+assert( is_directory( &quot;foo&quot; ) == is_directory( &quot;foo&quot; ) ); //
 (3)</code></p>
 </blockquote>
-<p>(1) will fail if a non-existent &quot;foo&quot; comes into existence, or an
-existent &quot;foo&quot; is removed, between the first and second call to <i>exists()</i>.
-This could happen if, during the execution of the example code, another thread,
+<p>(1) will fail if a non-existent &quot;foo&quot; comes into existence, or an
+existent &quot;foo&quot; is removed, between the first and second call to <i>exists()</i>.
+This could happen if, during the execution of the example code, another thread,
 process, or computer is also performing operations in the same directory.</p>
 <p>(2) will fail if between the call to <i>remove_all()</i> and the call to
-<i>exists()</i> a new file or directory named &quot;foo&quot; is created by another
+<i>exists()</i> a new file or directory named &quot;foo&quot; is created by another
 thread, process, or computer.</p>
-<p>(3) will fail if another thread, process, or computer removes an
-existing file &quot;foo&quot; and then creates a directory named &quot;foo&quot;, between the
+<p>(3) will fail if another thread, process, or computer removes an
+existing file &quot;foo&quot; and then creates a directory named &quot;foo&quot;, between the
 example code's two calls to <i>is_directory()</i>.</p>
 </blockquote>
 <h4><b>May throw exceptions</b></h4>
 <p>Unless otherwise specified, Boost.Filesystem functions throw <i>
-basic_filesystem_error</i>
-exceptions if they cannot successfully complete their operational
-specifications. Also, implementations may use C++ Standard Library functions,
-which may throw <i>std::bad_alloc</i>. These exceptions may be thrown even
-though the error condition leading to the exception is not explicitly specified
+basic_filesystem_error</i>
+exceptions if they cannot successfully complete their operational
+specifications. Also, implementations may use C++ Standard Library functions,
+which may throw <i>std::bad_alloc</i>. These exceptions may be thrown even
+though the error condition leading to the exception is not explicitly specified
 in the function's &quot;Throws&quot; paragraph.</p>
-<p>All exceptions thrown by the Filesystem
+<p>All exceptions thrown by the Filesystem
 Library are implemented by calling <a href="../../../utility/throw_exception.html">
-boost::throw_exception()</a>. Thus exact behavior may differ depending on
+boost::throw_exception()</a>. Thus exact behavior may differ depending on
 BOOST_NO_EXCEPTIONS at the time the filesystem source files are compiled.</p>
-<p>Non-throwing versions are provided of several functions that are often used
+<p>Non-throwing versions are provided of several functions that are often used
 in contexts where error codes may be the preferred way to report an error.</p>
 
 <h2><a name="Headers">Headers</a></h2>
@@ -249,31 +249,31 @@
 <p>The Boost.Filesystem library provides several&nbsp;headers:</p>
 
 <ul>
- <li>Header &lt;boost/filesystem.hpp&gt;
+ <li>Header &lt;boost/filesystem.hpp&gt;
   provides access to all features of the library, except file streams.<br>
 &nbsp;</li>
- <li>Header &lt;boost/filesystem/fstream.hpp&gt;
- inherits the same components as the C++ Standard
- Library's <i>fstream</i> header, but files are identified by <code>const path&amp;</code>
+ <li>Header &lt;boost/filesystem/fstream.hpp&gt;
+ inherits the same components as the C++ Standard
+ Library's <i>fstream</i> header, but files are identified by <code>const path&amp;</code>
   arguments rather that <code>const char*</code> arguments.</li>
 </ul>
 <h2><a name="Examples">Example programs</a></h2>
 <p>See the tutorial for example programs.</p>
 <h3>Other examples</h3>
-<p>The programs used to generate the Boost regression test status tables use the
+<p>The programs used to generate the Boost regression test status tables use the
 Filesystem Library extensively.&nbsp; See:</p>
 <ul>
   <li>process_jam_log.cpp</li>
   <li>compiler_status.cpp</li>
 </ul>
 <h2><a name="Implementation">Implementation</a></h2>
-<p>The current implementation supports operating systems which provide
+<p>The current implementation supports operating systems which provide
 the POSIX or Windows API's.</p>
-<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
-Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
+<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
+Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
 of compilers.</p>
 <h2><a name="Macros">Macros</a></h2>
-<p>Users may defined the following macros if desired. Sensible defaults are
+<p>Users may defined the following macros if desired. Sensible defaults are
 provided, so users can ignore these macros unless they have special needs.</p>
 <table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
   <tr>
@@ -288,88 +288,88 @@
   </tr>
   <tr>
     <td valign="top"><code>BOOST_FILESYSTEM_DYN_LINK</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
+ <td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
     otherwise not defined.</td>
- <td valign="top">The Boost.Filesystem library is dynamically linked. If not defined,
+ <td valign="top">The Boost.Filesystem library is dynamically linked. If not defined,
     static linking is assumed.</td>
   </tr>
   <tr>
     <td valign="top"><code>BOOST_FILESYSTEM_NO_LIB</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
+ <td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
     otherwise not defined.</td>
- <td valign="top">Boost.Filesystem library does not use the Boost auto-link
+ <td valign="top">Boost.Filesystem library does not use the Boost auto-link
     facility.</td>
   </tr>
   </table>
-<p>User-defined BOOST_POSIX_API and BOOST_WINDOWS_API macros are no longer
+<p>User-defined BOOST_POSIX_API and BOOST_WINDOWS_API macros are no longer
 supported.</p>
 <h2><a name="Building">Building</a> the object-library</h2>
-<p>The object-library will be built automatically if you are using the Boost
+<p>The object-library will be built automatically if you are using the Boost
 build system. See
-Getting Started. It can also be
-built manually using a Jamfile
-supplied in directory libs/filesystem/build, or the user can construct an IDE
+Getting Started. It can also be
+built manually using a Jamfile
+supplied in directory libs/filesystem/build, or the user can construct an IDE
 project or make file which includes the object-library source files.</p>
-<p>The object-library source files are
-supplied in directory libs/filesystem/src. These source files implement the
-library for POSIX or Windows compatible operating systems; no implementation is
-supplied for other operating systems. Note that many operating systems not
-normally thought of as POSIX systems, such as mainframe legacy
-operating systems or embedded operating systems, support POSIX compatible file
+<p>The object-library source files are
+supplied in directory libs/filesystem/src. These source files implement the
+library for POSIX or Windows compatible operating systems; no implementation is
+supplied for other operating systems. Note that many operating systems not
+normally thought of as POSIX systems, such as mainframe legacy
+operating systems or embedded operating systems, support POSIX compatible file
 systems and so will work with the Filesystem Library.</p>
-<p>The object-library can be built for static or dynamic (shared/dll) linking.
-This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
+<p>The object-library can be built for static or dynamic (shared/dll) linking.
+This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
 macros. See the <a href="http://www.boost.org/development/separate_compilation.html">Separate
 Compilation</a> page for a description of the techniques used.</p>
 <h3>Note for <a name="Cgywin">Cygwin</a> users</h3>
-<p> Cygwin version 1.7 or later is
+<p> Cygwin version 1.7 or later is
 required because only versions of GCC with wide character strings are supported.</p>
 
-<p> The library's implementation code treats Cygwin as a Windows platform, and
-thus uses the Windows API and uses Windows path syntax as the native path
+<p> The library's implementation code treats Cygwin as a Windows platform, and
+thus uses the Windows API and uses Windows path syntax as the native path
 syntax.</p>
 
 <h2><a name="Change-history">Version history</a></h2>
 
 <h3>Version 3</h3>
 
-<p>Boost <span style="background-color: #FFFF00">1.??.0 - ???, 2010</span> - Internationalization via single class <code>path</code>.
+<p>Boost <span style="background-color: #FFFF00">1.??.0 - ???, 2010</span> - Internationalization via single class <code>path</code>.
 More uniform error handling.</p>
 
-<p>Peter Dimov suggested use of a single path class rather than a <code>basic_path</code>
+<p>Peter Dimov suggested use of a single path class rather than a <code>basic_path</code>
 class template. That idea was the basis for the Version 3 redesign.</p>
 
-<p>Thanks for comments from Robert Stewart, Zach Laine, Peter Dimov, Gregory
+<p>Thanks for comments from Robert Stewart, Zach Laine, Peter Dimov, Gregory
 Peele, Scott McMurray, John Bytheway, Jeff Flinn, Jeffery Bosboom.</p>
 
 <h3>Version 2</h3>
 
-<p>Boost 1.34.0 - May, 2007 - Internationalization via <code>basic_path</code>
+<p>Boost 1.34.0 - May, 2007 - Internationalization via <code>basic_path</code>
 template.</p>
 
-<p>So many people have contributed comments and bug reports that it isn't any
-longer possible to acknowledge them individually. That said, Peter Dimov and Rob
-Stewart need to be specially thanked for their many constructive criticisms and
-suggestions. Terence
-Wilson and Chris Frey contributed timing programs which helped illuminate
+<p>So many people have contributed comments and bug reports that it isn't any
+longer possible to acknowledge them individually. That said, Peter Dimov and Rob
+Stewart need to be specially thanked for their many constructive criticisms and
+suggestions. Terence
+Wilson and Chris Frey contributed timing programs which helped illuminate
 performance issues.</p>
 
 <h3>Version 1</h3>
 
 <p>Boost 1.30.0 - March, 2003 - Initial official Boost release.</p>
 
-<p>The Filesystem Library was designed and implemented by Beman Dawes. The
-original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
-based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
-was a particular help in later stages of initial development. Peter Dimov and
-Rob Stewart made many useful suggestions and comments over a long period of
+<p>The Filesystem Library was designed and implemented by Beman Dawes. The
+original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
+based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
+was a particular help in later stages of initial development. Peter Dimov and
+Rob Stewart made many useful suggestions and comments over a long period of
 time. Howard Hinnant helped with internationalization issues.</p>
 
 <p>Key design requirements and
-design realities were developed during
-extensive discussions on the Boost mailing list, followed by comments on the
-initial implementation. Numerous helpful comments were then received during the
-Formal Review.<p>Participants included
+design realities were developed during
+extensive discussions on the Boost mailing list, followed by comments on the
+initial implementation. Numerous helpful comments were then received during the
+Formal Review.<p>Participants included
 Aaron Brashears,
 Alan Bellingham,
 Aleksey Gurtovoy,
@@ -377,62 +377,62 @@
 Alisdair Meredith,
 Andy Glew,
 Anthony Williams,
-Baptiste Lepilleur,
+Baptiste Lepilleur,
 Beman Dawes,
 Bill Kempf,
-Bill Seymour,
+Bill Seymour,
 Carl Daniel,
 Chris Little,
 Chuck Allison,
-Craig Henderson,
+Craig Henderson,
 Dan Nuffer,
 Dan'l Miller,
-Daniel Frey,
-Darin Adler,
+Daniel Frey,
+Darin Adler,
 David Abrahams,
-David Held,
+David Held,
 Davlet Panech,
 Dietmar Kuehl,
-Douglas Gregor,
+Douglas Gregor,
 Dylan Nicholson,
-Ed Brey,
+Ed Brey,
 Eric Jensen,
 Eric Woodruff,
 Fedder Skovgaard,
 Gary Powell,
 Gennaro Prota,
-Geoff Leyland,
-George Heintzelman,
+Geoff Leyland,
+George Heintzelman,
 Giovanni Bajo,
 Glen Knowles,
 Hillel Sims,
 Howard Hinnant,
 Jaap Suter,
-James Dennett,
-Jan Langer,
-Jani Kajala,
-Jason Stewart,
+James Dennett,
+Jan Langer,
+Jani Kajala,
+Jason Stewart,
 Jeff Garland,
 Jens Maurer,
 Jesse Jones,
 Jim Hyslop,
 Joel de Guzman,
 Joel Young,
-John Levon,
+John Levon,
 John Maddock,
 John Williston,
 Jonathan Caves,
 Jonathan Biggar,
 Jurko,
 Justus Schwartz,
-Keith Burton,
+Keith Burton,
 Ken Hagen,
-Kostya Altukhov,
+Kostya Altukhov,
 Mark Rodgers,
-Martin Schuerch,
+Martin Schuerch,
 Matt Austern,
-Matthias Troyer,
-Mattias Flodin,
+Matthias Troyer,
+Mattias Flodin,
 Michiel Salters,
 Mickael Pointier,
 Misha Bergal,
@@ -440,7 +440,7 @@
 Noel Yap,
 Parksie,
 Patrick Hartling, Pavel Vozenilek,
-Pete Becker,
+Pete Becker,
 Peter Dimov,
 Rainer Deyke,
 Rene Rivera,
@@ -449,19 +449,19 @@
 Ron Garcia,
 Ross Smith,
 Sashan,
-Steve Robbins,
-Thomas Witt,
-Tom Harris,
+Steve Robbins,
+Thomas Witt,
+Tom Harris,
 Toon Knapen,
 Victor Wagner,
 Vincent Finn,
 Vladimir Prus, and
 Yitzhak Sapir
-
-<p>A lengthy discussion on the C++ committee's library reflector illuminated the &quot;illusion
+
+<p>A lengthy discussion on the C++ committee's library reflector illuminated the &quot;illusion
 of portability&quot; problem, particularly in postings by PJ Plauger and Pete Becker.</p>
 
-<p>Walter Landry provided much help illuminating symbolic link use cases for
+<p>Walter Landry provided much help illuminating symbolic link use cases for
 version 1.31.0.&nbsp;</p>
 
 <hr>
@@ -469,7 +469,7 @@
 <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->11 June, 2010<!--webbot bot="Timestamp" endspan i-checksum="19839" --></p>
 
 <p>&copy; Copyright Beman Dawes, 2002-2005</p>
-<p> Use, modification, and distribution are subject to the Boost Software
+<p> Use, modification, and distribution are subject to the Boost Software
 License, Version 1.0. See <a href="http://www.boost.org/LICENSE_1_0.txt">
 www.boost.org/LICENSE_1_0.txt</a></p>
 

Copied: website/public_html/beta/doc/fixes/boost_1_45_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_45_0/libs/libraries.htm)
==============================================================================
--- /website/public_html/beta/doc/libs/1_45_0/libs/libraries.htm (original)
+++ website/public_html/beta/doc/fixes/boost_1_45_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -239,10 +239,10 @@
         Abrahams.</li>
     <li>random - A complete
         system for random number generation, from Jens Maurer.</li>
- <li>range - Concepts and utilities for
- range-based algorithms, as well as range-based algorithms and range
- adaptors that allow for efficient and very expressive code, from
- Thorsten Ottosen and Neil Groves.</li>
+ <li>range - Concepts and utilities for
+ range-based algorithms, as well as range-based algorithms and range
+ adaptors that allow for efficient and very expressive code, from
+ Thorsten Ottosen and Neil Groves.</li>
     <li>rational - A rational
         number class, from Paul Moore.</li>
 

Copied: website/public_html/beta/doc/fixes/boost_1_46_1/more/getting_started/unix-variants.html (from r80716, /website/public_html/beta/doc/libs/1_46_1/more/getting_started/unix-variants.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_48_0/libs/libraries.htm (from r80716, /website/public_html/beta/doc/libs/1_48_0/libs/libraries.htm)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_48_0/libs/timer/index.html (from r80716, /website/public_html/beta/doc/libs/1_48_0/libs/timer/index.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_48_0/libs/timer/index.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_48_0/libs/timer/index.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -6,7 +6,7 @@
 Automatic redirection failed, please go to doc/index.html.
 <hr>
 <p>&copy; Copyright Beman Dawes, 2003, 2011</p>
-<p> Distributed under the Boost Software
+<p> Distributed under the Boost Software
 License, Version 1.0.</p>
 <p> See <a href="http://www.boost.org/LICENSE_1_0.txt">
 www.boost.org/LICENSE_1_0.txt</a></p>

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/index.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/index.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/actor.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/actor.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/basics.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/basics.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -165,7 +165,7 @@
 <span class="special">{</span>
         <span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-
+
         <span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
                 <span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
 
@@ -284,7 +284,7 @@
 <span class="special">{</span>
         <span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-
+
         <span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
                 <span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
 

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/introduction.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/introduction.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/organization.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/organization.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/references.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html (from r80716, /website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/index.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/index.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/actor.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/actor.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/basics.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/basics.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html)
==============================================================================
--- /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html (original)
+++ website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
@@ -165,7 +165,7 @@
 <span class="special">{</span>
         <span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-
+
         <span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
                 <span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
 
@@ -284,7 +284,7 @@
 <span class="special">{</span>
         <span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-
+
         <span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
                 <span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
 

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/introduction.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/introduction.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/organization.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/organization.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/references.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html)
==============================================================================

Copied: website/public_html/beta/doc/fixes/boost_1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html (from r80716, /website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html)
==============================================================================

Deleted: website/public_html/beta/doc/libs/1_33_1/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_33_1/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,616 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
-<table border="1" cellpadding="2" bgcolor="#007F7F">
- <tr>
- <td bgcolor="#FFFFFF">
- <img src="../boost.png"
- alt="boost.png (6897 bytes)" width="277" height="86"></td>
- <td><a href="../index.htm"><font color="#FFFFFF" size="4"
- face="Arial">Home</font></a></td>
- <td><a href="libraries.htm"><font color="#FFFFFF"
- size="4" face="Arial">Libraries</font></a></td>
- <td><a href="../people/people.htm"><font color="#FFFFFF"
- size="4" face="Arial">People</font></a></td>
- <td><a href="../more/faq.htm"><font color="#FFFFFF"
- size="4" face="Arial">FAQ</font></a></td>
- <td><a href="../more/index.htm"><font color="#FFFFFF"
- size="4" face="Arial">More</font></a></td>
- </tr>
-</table>
-
-<h1>Boost Libraries and Documentation</h1>
-
-<p>
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-</p>
-
-<p>See Compiler Status
- page to find out what library works with which compiler.<br>
-See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available in other forms,
- including DocBook, XSL Formatting Objects, and Unix man pages. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.33.1/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&acute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko Järvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- Mathematical special functions such as atanh, sinc, and sinhc,
- from Hubert Holin.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko Järvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Hervé Brönnimann and Sylvain Pion.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- Mathematical special functions such as atanh, sinc, and sinhc,
- from Hubert Holin.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->02 Aug 2005<!--webbot bot="Timestamp" endspan i-checksum="14768" --></p>
-
-<p>© Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See accompanying file LICENSE_1_0.txt
-or copy at www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_34_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_34_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,633 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 6.0">
-<title>Boost Libraries</title>
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
-<table border="1" cellpadding="2" bgcolor="#007F7F">
- <tr>
- <td bgcolor="#FFFFFF">
- <img src="../boost.png"
- alt="boost.png (6897 bytes)" width="277" height="86"></td>
- <td><a href="../index.htm"><font color="#FFFFFF" size="4"
- face="Arial">Home</font></a></td>
- <td><a href="libraries.htm"><font color="#FFFFFF"
- size="4" face="Arial">Libraries</font></a></td>
- <td><a href="../people/people.htm"><font color="#FFFFFF"
- size="4" face="Arial">People</font></a></td>
- <td><a href="../more/faq.htm"><font color="#FFFFFF"
- size="4" face="Arial">FAQ</font></a></td>
- <td><a href="../more/index.htm"><font color="#FFFFFF"
- size="4" face="Arial">More</font></a></td>
- </tr>
-</table>
-
-<h1>Boost Libraries and Documentation</h1>
-
-<p>
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-</p>
-
-<p>See Compiler Status
- page to find out what library works with which compiler.<br>
-See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&acute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko Järvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- Mathematical special functions such as atanh, sinc, and sinhc,
- from Hubert Holin.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko Järvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Hervé Brönnimann and Sylvain Pion.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- Mathematical special functions such as atanh, sinc, and sinhc,
- from Hubert Holin.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->12 Mar 2006<!--webbot bot="Timestamp" endspan i-checksum="14901" --></p>
-
-<p>© Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See accompanying file LICENSE_1_0.txt
-or copy at www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
-

Deleted: website/public_html/beta/doc/libs/1_35_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_35_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,706 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
-</table>
-
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking, including
- sockets, timers, hostname resolution and socket iostreams, from
- Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&acute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J?rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. </li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking, including
- sockets, timers, hostname resolution and socket iostreams, from
- Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv? Br?nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking, including
- sockets, timers, hostname resolution and socket iostreams, from
- Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->19 Mar 2008<!--webbot bot="Timestamp" endspan i-checksum="14923" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_36_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_36_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,720 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J?rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>Cacciola.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->19 Mar 2008<!--webbot bot="Timestamp" endspan i-checksum="14923" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_37_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_37_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,724 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J?rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>Cacciola.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->19 Mar 2008<!--webbot bot="Timestamp" endspan i-checksum="14923" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_38_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_38_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,742 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is also available as pdfs. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.38.0/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J?rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J?rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko Järvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->27 Jan 2009<!--webbot bot="Timestamp" endspan i-checksum="14772" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
\ No newline at end of file

Deleted: website/public_html/beta/doc/libs/1_39_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_39_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,742 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->27 Jan 2009<!--webbot bot="Timestamp" endspan i-checksum="14772" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
-

Deleted: website/public_html/beta/doc/libs/1_40_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_40_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,747 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available as pdfs. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.40.0/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->27 Jan 2009<!--webbot bot="Timestamp" endspan i-checksum="14772" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
-

Deleted: website/public_html/beta/doc/libs/1_41_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_41_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,760 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available as pdfs. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.41.0/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>result_of - determines the type of a function call expression.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Five smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->03 Nov 2009<!--webbot bot="Timestamp" endspan i-checksum="15274" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
\ No newline at end of file

Deleted: website/public_html/beta/doc/libs/1_42_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_42_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,762 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available as pdfs. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.42.0/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>result_of - determines the type of a function call expression.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->03 Nov 2009<!--webbot bot="Timestamp" endspan i-checksum="15274" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
\ No newline at end of file

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,775 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/html/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available as pdfs. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.43.0/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/factory -
- function object templates for dynamic and static object creation,
- from Tobias Schwinger</li>
- <li>functional/forward -
- adapters to allow generic function objects to accept arbitrary
- arguments, from Tobias Schwinger</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - Concepts and utilities for
- range-based algorithms, as well as range-based algorithms and range
- adaptors that allow for efficient and very expressive code, from
- Thorsten Ottosen and Neil Groves.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>result_of - determines the type of a function call expression.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/factory -
- function object templates for dynamic and static object creation,
- from Tobias Schwinger</li>
- <li>functional/forward -
- adapters to allow generic function objects to accept arbitrary
- arguments, from Tobias Schwinger</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->03 Nov 2009<!--webbot bot="Timestamp" endspan i-checksum="15274" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/index.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/index.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,151 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Chapter&#160;1.&#160;Range 2.0</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="next" href="range/introduction.html" title="Introduction">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav"><a accesskey="n" href="range/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="chapter" title="Chapter&#160;1.&#160;Range 2.0">
-<div class="titlepage"><div>
-<div><h2 class="title">
-<a name="range"></a>Chapter&#160;1.&#160;Range 2.0</h2></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Thorsten</span> <span class="surname">Ottosen</span>
-</h3></div></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Neil</span> <span class="surname">Groves</span>
-</h3></div></div>
-<div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
-<div><div class="legalnotice" title="Legal Notice">
-<a name="id554184"></a><p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></div>
-</div></div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="section">Introduction</span></dt>
-<dt><span class="section"> Range Concepts</span></dt>
-<dd><dl>
-<dt><span class="section">Overview</span></dt>
-<dt><span class="section">Single Pass Range</span></dt>
-<dt><span class="section">Forward Range</span></dt>
-<dt><span class="section">Bidirectional Range</span></dt>
-<dt><span class="section">Random Access Range</span></dt>
-<dt><span class="section">Concept Checking</span></dt>
-</dl></dd>
-<dt><span class="section"> Reference</span></dt>
-<dd><dl>
-<dt><span class="section">Overview</span></dt>
-<dt><span class="section"><a href="range/reference/concept_implementation.html"> Range concept
- implementation</a></span></dt>
-<dd><dl>
-<dt><span class="section">Synopsis</span></dt>
-<dt><span class="section">Semantics</span></dt>
-</dl></dd>
-<dt><span class="section"> Range Adaptors</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="range/reference/adaptors/introduction.html"> Introduction
- and motivation</a></span></dt>
-<dt><span class="section"><a href="range/reference/adaptors/general_requirements.html"> General
- Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
-</dl></dd>
-<dt><span class="section"> Range Algorithm</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="range/reference/algorithms/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"> Mutating algorithms</span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/non_mutating.html"> Non-mutating
- algorithms</a></span></dt>
-<dt><span class="section"> Set algorithms</span></dt>
-<dt><span class="section"> Heap algorithms</span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/permutation.html"> Permutation
- algorithms</a></span></dt>
-<dt><span class="section"> New algorithms</span></dt>
-<dt><span class="section"> Numeric algorithms</span></dt>
-</dl></dd>
-<dt><span class="section"> Provided Ranges</span></dt>
-<dd><dl>
-<dt><span class="section"> counting_range</span></dt>
-<dt><span class="section"> istream_range</span></dt>
-<dt><span class="section"> irange</span></dt>
-</dl></dd>
-<dt><span class="section"> Utilities</span></dt>
-<dd><dl>
-<dt><span class="section"> Class iterator_range</span></dt>
-<dt><span class="section"> Class sub_range</span></dt>
-<dt><span class="section"> Function join</span></dt>
-</dl></dd>
-<dt><span class="section"> Extending the library</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="range/reference/extending/method_1.html"> Method 1: provide
- member functions and nested types</a></span></dt>
-<dt><span class="section"><a href="range/reference/extending/method_2.html"> Method 2: provide
- free-standing functions and specialize metafunctions</a></span></dt>
-<dt><span class="section"><a href="range/reference/extending/method_3.html"> Method 3: provide
- range adaptor implementations</a></span></dt>
-</dl></dd>
-</dl></dd>
-<dt><span class="section"> Terminology and style guidelines</span></dt>
-<dt><span class="section">Library Headers</span></dt>
-<dd><dl>
-<dt><span class="section">General</span></dt>
-<dt><span class="section">Adaptors</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-<dt><span class="section"><a href="range/library_headers/algorithm_extensions.html">Algorithm
- Extensions</a></span></dt>
-</dl></dd>
-<dt><span class="section">Examples</span></dt>
-<dt><span class="section"> MFC/ATL (courtesy of Shunsuke Sogame)</span></dt>
-<dd><dl>
-<dt><span class="section"> Requirements</span></dt>
-<dt><span class="section"> MFC Ranges</span></dt>
-<dt><span class="section"> ATL Ranges</span></dt>
-<dt><span class="section"> const Ranges</span></dt>
-<dt><span class="section"> References</span></dt>
-</dl></dd>
-<dt><span class="section"> Upgrade version of Boost.Range</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="range/upgrade/upgrade_from_1_42.html"> Upgrade from version
- 1.42</a></span></dt>
-<dt><span class="section"><a href="range/upgrade/upgrade_from_1_34.html"> Upgrade from version
- 1.34</a></span></dt>
-</dl></dd>
-<dt><span class="section">Portability</span></dt>
-<dt><span class="section">FAQ</span></dt>
-<dt><span class="section"> History and Acknowledgement</span></dt>
-</dl>
-</div>
-<p>
- Boost.Range is a collection of concepts and utilities, range-based algorithms,
- as well as range adaptors that allow for efficient and expressive code.
- </p>
-<p>
- Using Boost.Range inplace of the standard library alternatives results in more
- readable code and in many cases greater efficiency.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: May 15, 2010 at 19:03:38 GMT</small></p></td>
-<td align="right"><div class="copyright-footer"></div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav"><a accesskey="n" href="range/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,51 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Concepts</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="introduction.html" title="Introduction">
-<link rel="next" href="concepts/overview.html" title="Overview">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Concepts">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.concepts"></a><a class="link" href="concepts.html" title="Range Concepts"> Range Concepts</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Overview</span></dt>
-<dt><span class="section">Single Pass Range</span></dt>
-<dt><span class="section">Forward Range</span></dt>
-<dt><span class="section">Bidirectional Range</span></dt>
-<dt><span class="section">Random Access Range</span></dt>
-<dt><span class="section">Concept Checking</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/bidirectional_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,300 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Bidirectional Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concepts.html" title="Range Concepts">
-<link rel="prev" href="forward_range.html" title="Forward Range">
-<link rel="next" href="random_access_range.html" title="Random Access Range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="forward_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_access_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Bidirectional Range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.concepts.bidirectional_range"></a><a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
-</h3></div></div></div>
-<a name="range.concepts.bidirectional_range.notation"></a><h5>
-<a name="id557706"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">X</span></code>
- </p>
- </td>
-<td>
- <p>
- A type that is a model of <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">a</span></code>
- </p>
- </td>
-<td>
- <p>
- Object of type X.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id557800"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
- </h5>
-<p>
- This concept provides access to iterators that traverse in both directions
- (forward and reverse). The <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> iterator must meet all of the requirements
- of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators" target="_top">Bidirectional
- Traversal Iterator</a>.
- </p>
-<a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id557864"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
- of</a>
- </h5>
-<p>
- <a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
- </p>
-<a name="range.concepts.bidirectional_range.associated_types"></a><h5>
-<a name="id557890"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
- types</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Reverse Iterator type
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- The type of iterator used to iterate through a Range's elements
- in reverse order. The iterator's value type is expected to be the
- Range's value type. A conversion from the reverse iterator type
- to the const reverse iterator type must exist.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Const reverse iterator type
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- A type of reverse iterator that may be used to examine, but not
- to modify, a Range's elements.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id558053"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
- expressions</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Name
- </p>
- </th>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-<th>
- <p>
- Semantics
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Beginning of range
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
- is mutable <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise.
- </p>
- </td>
-<td>
- <p>
- Equivalent to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- End of range
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
- is mutable, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise.
- </p>
- </td>
-<td>
- <p>
- Equivalent to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id558511"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
- guarantees</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> has
- the same complexity as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> and
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> has the same complexity as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> from
- <a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>.
- </p>
-<a name="range.concepts.bidirectional_range.invariants"></a><h5>
-<a name="id558651"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Valid reverse range
- </p>
- </td>
-<td>
- <p>
- For any Bidirectional Range a, <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>
- is a valid range, that is, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> is reachable from <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- in a finite number of increments.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Completeness
- </p>
- </td>
-<td>
- <p>
- An algorithm that iterates through the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">a</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>
- will pass through every element of <code class="computeroutput"><span class="identifier">a</span></code>.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id558904"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
- </h5>
-<p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
- of metafunctions</a>
- </p>
-<p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
- of functions</a>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="forward_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_access_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/concept_checking.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,108 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Concept Checking</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concepts.html" title="Range Concepts">
-<link rel="prev" href="random_access_range.html" title="Random Access Range">
-<link rel="next" href="../reference.html" title="Reference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="random_access_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Concept Checking">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.concepts.concept_checking"></a><a class="link" href="concept_checking.html" title="Concept Checking">Concept Checking</a>
-</h3></div></div></div>
-<p>
- Each of the range concepts has a corresponding concept checking class in
- the file <boost/range/concepts.hpp>.
- These classes may be used in conjunction with the <a href="../../../../../../libs/concept_check/index.html" target="_top">Boost
- Concept Check library</a> to ensure that the type of a template parameter
- is compatible with a range concept. If not, a meaningful compile time error
- is generated. Checks are provided for the range concepts related to iterator
- traversal categories. For example, the following line checks that the type
- <code class="computeroutput"><span class="identifier">T</span></code> models the <a class="link" href="forward_range.html" title="Forward Range">Forward
- Range</a> concept.
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
-</pre>
-<p>
- </p>
-<p>
- An additional concept check is required for the value access property of
- the range based on the range's iterator type. For example to check for a
- ForwardReadableRange, the following code is required.
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
-<span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ReadableIteratorConcept</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">));</span>
-</pre>
-<p>
- </p>
-<p>
- The following range concept checking classes are provided.
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- Class SinglePassRangeConcept checks for <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
- Class ForwardRangeConcept checks for <a class="link" href="forward_range.html" title="Forward Range">Forward
- Range</a>
-</li>
-<li class="listitem">
- Class BidirectionalRangeConcept checks for <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
-</li>
-<li class="listitem">
- Class RandomAccessRangeConcept checks for <a class="link" href="random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-</ul></div>
-<a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id560146"></a>
- <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
- </h5>
-<p>
- <a class="link" href="../style_guide.html" title="Terminology and style guidelines">Range Terminology and style guidelines</a>
- </p>
-<p>
- Iterator concepts
- </p>
-<p>
- Boost Concept Check library
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="random_access_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/forward_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,160 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Forward Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concepts.html" title="Range Concepts">
-<link rel="prev" href="single_pass_range.html" title="Single Pass Range">
-<link rel="next" href="bidirectional_range.html" title="Bidirectional Range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="single_pass_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Forward Range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.concepts.forward_range"></a><a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
-</h3></div></div></div>
-<a name="range.concepts.forward_range.notation"></a><h5>
-<a name="id557310"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">X</span></code>
- </p>
- </td>
-<td>
- <p>
- A type that is a model of <a class="link" href="forward_range.html" title="Forward Range">Forward
- Range</a>.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">a</span></code>
- </p>
- </td>
-<td>
- <p>
- Object of type X.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.forward_range.description"></a><h5>
-<a name="id557402"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
- </h5>
-<p>
- A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
- Traversal Iterator</a>.
- </p>
-<a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id557470"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.refinement_of">Refinement of</a>
- </h5>
-<p>
- <a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </p>
-<a name="range.concepts.forward_range.associated_types"></a><h5>
-<a name="id557497"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
- types</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Distance type
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- A signed integral type used to represent the distance between two
- of the Range's iterators. This type must be the same as the iterator's
- distance type.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Size type
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- An unsigned integral type that can represent any nonnegative value
- of the Range's distance type.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id557652"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
- </h5>
-<p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
- of metafunctions</a>
- </p>
-<p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
- of functions</a>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="single_pass_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/overview.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,79 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Overview</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concepts.html" title="Range Concepts">
-<link rel="prev" href="../concepts.html" title="Range Concepts">
-<link rel="next" href="single_pass_range.html" title="Single Pass Range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../concepts.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="single_pass_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Overview">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.concepts.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
-</h3></div></div></div>
-<p>
- A Range is a <span class="bold"><strong><span class="emphasis"><em>concept</em></span></strong></span>
- similar to the STL Container
- concept. A Range provides iterators for accessing a half-open range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">one_past_last</span><span class="special">)</span></code> of elements and provides information about
- the number of elements in the Range. However, a Range has fewer requirements
- than a Container.
- </p>
-<p>
- The motivation for the Range concept is that there are many useful Container-like
- types that do not meet the full requirements of Container, and many algorithms
- that can be written with this reduced set of requirements. In particular,
- a Range does not necessarily
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- own the elements that can be accessed through it,
- </li>
-<li class="listitem">
- have copy semantics,
- </li>
-</ul></div>
-<p>
- Because of the second requirement, a Range object must be passed by (const
- or non-const) reference in generic code.
- </p>
-<p>
- The operations that can be performed on a Range is dependent on the <a href="../../../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal" target="_top">traversal
- category</a> of the underlying iterator type. Therefore the range concepts
- are named to reflect which traversal category its iterators support. See
- also terminology and style guidelines. for more information about naming
- of ranges.
- </p>
-<p>
- The concepts described below specifies associated types as metafunctions
- and all functions as free-standing functions to allow for a layer of indirection.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../concepts.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="single_pass_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/random_access_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,187 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Random Access Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concepts.html" title="Range Concepts">
-<link rel="prev" href="bidirectional_range.html" title="Bidirectional Range">
-<link rel="next" href="concept_checking.html" title="Concept Checking">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_checking.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Random Access Range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.concepts.random_access_range"></a><a class="link" href="random_access_range.html" title="Random Access Range">Random Access Range</a>
-</h3></div></div></div>
-<a name="range.concepts.random_access_range.description"></a><h5>
-<a name="id558958"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
- </h5>
-<p>
- A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators" target="_top">Random
- Access Traversal Iterator</a>.
- </p>
-<a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id559297"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
- of</a>
- </h5>
-<p>
- <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
- </p>
-<a name="range.concepts.random_access_range.valid_expressions"></a><h5>
-<a name="id559325"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
- expressions</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Name
- </p>
- </th>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-</tr></thead>
-<tbody><tr>
-<td>
- <p>
- Size of range
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-</tr></tbody>
-</table></div>
-<a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id559468"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
- semantics</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Semantics
- </p>
- </th>
-<th>
- <p>
- Postcondition
- </p>
- </th>
-</tr></thead>
-<tbody><tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- Returns the size of the Range, that is, its number of elements.
- Note <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span>
- <span class="special">==</span> <span class="number">0u</span></code>
- is equivalent to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>.
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span>
- <span class="special">&gt;=</span> <span class="number">0</span></code>
- </p>
- </td>
-</tr></tbody>
-</table></div>
-<a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id559686"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
- guarantees</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> completes in amortized constant time.
- </p>
-<a name="range.concepts.random_access_range.invariants"></a><h5>
-<a name="id559736"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody><tr>
-<td>
- <p>
- Range size
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- is equal to the <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> - <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>.
- </p>
- </td>
-</tr></tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_checking.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/concepts/single_pass_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,350 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Single Pass Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concepts.html" title="Range Concepts">
-<link rel="prev" href="overview.html" title="Overview">
-<link rel="next" href="forward_range.html" title="Forward Range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Single Pass Range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.concepts.single_pass_range"></a><a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-</h3></div></div></div>
-<a name="range.concepts.single_pass_range.notation"></a><h5>
-<a name="id555984"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">X</span></code>
- </p>
- </td>
-<td>
- <p>
- A type that is a model of <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">a</span></code>
- </p>
- </td>
-<td>
- <p>
- Object of type X.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id556080"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
- </h5>
-<p>
- A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators" target="_top">Single
- Pass Iterator</a>.
- </p>
-<a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id556148"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
- types</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Iterator type
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- The type of iterator used to iterate through a Range's elements.
- The iterator's value type is expected to be the Range's value type.
- A conversion from the iterator type to the <code class="computeroutput"><span class="keyword">const</span></code>
- iterator type must exist.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Const iterator type
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- A type of iterator that may be used to examine, but not to modify,
- a Range's elements.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id556317"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
- expressions</a>
- </h5>
-<p>
- The following expressions must be valid.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Name
- </p>
- </th>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Beginning of range
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
- is mutable, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- End of range
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> if <code class="computeroutput"><span class="identifier">a</span></code>
- is mutable, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> otherwise
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id556638"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
- semantics</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Semantics
- </p>
- </th>
-<th>
- <p>
- Postcondition
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- Returns an iterator pointing to the first element in the Range.
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- is either dereferenceable or past-the-end. It is past-the-end if
- and only if <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span> <span class="special">==</span> <span class="number">0</span></code>.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- Returns an iterator pointing one past the last element in the Range.
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- is past-the-end.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id556900"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
- guarantees</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> is at most amortized linear time, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> is amortized
- constant time. For most practical purposes, one can expect both to be amortized
- constant time.
- </p>
-<a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id556981"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
- </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Valid range
- </p>
- </td>
-<td>
- <p>
- For any Range <code class="computeroutput"><span class="identifier">a</span></code>,
- <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code> is a valid range, that is, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> in a finite number of increments.
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Completeness
- </p>
- </td>
-<td>
- <p>
- An algorithm that iterates through the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">a</span><span class="special">))</span></code>
- will pass through every element of <code class="computeroutput"><span class="identifier">a</span></code>.
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id557241"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
- </h5>
-<p>
- <a class="link" href="../reference/extending.html" title="Extending the library">Extending the library for UDTs</a>
- </p>
-<p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
- of metafunctions</a>
- </p>
-<p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
- of functions</a>
- </p>
-<p>
- Container
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/examples.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/examples.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,62 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Examples</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="library_headers/algorithm_extensions.html" title="Algorithm Extensions">
-<link rel="next" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="library_headers/algorithm_extensions.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Examples">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
-</h2></div></div></div>
-<p>
- Some examples are given in the accompanying test files:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-string.cpp
- shows how to implement a container version of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">()</span></code> that works with <code class="computeroutput"><span class="keyword">char</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">char</span><span class="special">*</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">*</span></code>.
- </li>
-<li class="listitem">
-algorithm_example.cpp
- shows the replace example from the introduction.
- </li>
-<li class="listitem">iterator_range.cpp</li>
-<li class="listitem">sub_range.cpp</li>
-<li class="listitem">iterator_pair.cpp</li>
-<li class="listitem">reversible_range.cpp</li>
-<li class="listitem">std_container.cpp</li>
-<li class="listitem">array.cpp</li>
-</ul></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="library_headers/algorithm_extensions.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/faq.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/faq.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,126 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>FAQ</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="portability.html" title="Portability">
-<link rel="next" href="history_ack.html" title="History and Acknowledgement">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="portability.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history_ack.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="FAQ">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.faq"></a><a class="link" href="faq.html" title="FAQ">FAQ</a>
-</h2></div></div></div>
-<p>
- 1. <span class="emphasis"><em><span class="bold"><strong>Why is there no difference between <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">C</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- and <code class="computeroutput"><span class="identifier">range_const_iterator</span><span class="special">&lt;</span><span class="identifier">C</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- for <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">&gt;</span></code>?</strong></span></em></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- In general it is not possible nor desirable to find a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>. When it is possible to
- come up with one, the client might choose to construct a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code>
- object.
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Note that an <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> is somewhat more
- convenient than a <code class="computeroutput"><span class="identifier">pair</span></code>
- and that a <a class="link" href="reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a> does propagate const-ness.
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- 2. <span class="emphasis"><em><span class="bold"><strong>Why is there not supplied more types or
- more functions?</strong></span></em></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- The library has been kept small because its current interface will serve
- most purposes. If and when a genuine need arises for more functionality,
- it can be implemented.
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- 3. <span class="emphasis"><em><span class="bold"><strong>How should I implement generic algorithms
- for ranges?</strong></span></em></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- One should always start with a generic algorithm that takes two iterators
- (or more) as input. Then use Boost.Range to build handier versions on top
- of the iterator based algorithm. Please notice that once the range version
- of the algorithm is done, it makes sense not to expose the iterator version
- in the public interface.
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- 4. <span class="emphasis"><em><span class="bold"><strong>Why is there no Incrementable Range concept?</strong></span></em></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Even though we speak of incrementable iterators, it would not make much
- sense for ranges; for example, we cannot determine the size and emptiness
- of a range since we cannot even compare its iterators.
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Note also that incrementable iterators are derived from output iterators
- and so there exist no output range.
- </p>
-<p>
- </p>
-</blockquote></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="portability.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history_ack.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/history_ack.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,148 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>History and Acknowledgement</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="faq.html" title="FAQ">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="faq.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
-</div>
-<div class="section" title="History and Acknowledgement">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.history_ack"></a><a class="link" href="history_ack.html" title="History and Acknowledgement"> History and Acknowledgement</a>
-</h2></div></div></div>
-<a name="range.history_ack.version_1___before_boost_1_43"></a><h4>
-<a name="id688219"></a>
- <a class="link" href="history_ack.html#range.history_ack.version_1___before_boost_1_43">Version 1 -
- before Boost 1.43</a>
- </h4>
-<p>
- The library have been under way for a long time. Dietmar K&#252;hl originally intended
- to submit an <code class="computeroutput"><span class="identifier">array_traits</span></code> class
- template which had most of the functionality present now, but only for arrays
- and standard containers.
- </p>
-<p>
- Meanwhile work on algorithms for containers in various contexts showed the
- need for handling pairs of iterators, and string libraries needed special treatment
- of character arrays. In the end it made sense to formalize the minimal requirements
- of these similar concepts. And the results are the Range concepts found in
- this library.
- </p>
-<p>
- The term Range was adopted because of paragraph 24.1/7 from the C++ standard:
- </p>
-<p>
- Most of the library's algorithmic templates that operate on data structures
- have interfaces that use ranges. A range is a pair of iterators that designate
- the beginning and end of the computation. A range [i, i) is an empty range;
- in general, a range [i, j) refers to the elements in the data structure starting
- with the one pointed to by i and up to but not including the one pointed to
- by j. Range [i, j) is valid if and only if j is reachable from i. The result
- of the application of functions in the library to invalid ranges is undefined.
- </p>
-<p>
- Special thanks goes to
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- Pavol Droba for help with documentation and implementation
- </li>
-<li class="listitem">
- Pavel Vozenilek for help with porting the library
- </li>
-<li class="listitem">
- Jonathan Turkanis and John Torjo for help with documentation
- </li>
-<li class="listitem">
- Hartmut Kaiser for being review manager
- </li>
-<li class="listitem">
- Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
- </li>
-</ul></div>
-<p>
- The concept checks and their documentation was provided by Daniel Walker.
- </p>
-<a name="range.history_ack.version_2___boost_1_43_and_beyond"></a><h4>
-<a name="id688312"></a>
- <a class="link" href="history_ack.html#range.history_ack.version_2___boost_1_43_and_beyond">Version
- 2 - Boost 1.43 and beyond</a>
- </h4>
-<p>
- This version introduced Range Adaptors and Range Algorithms. This version 2
- is the result of a merge of all of the RangeEx features into Boost.Range.
- </p>
-<p>
- There were an enormous number of very significant contributors through all
- stages of this library.
- </p>
-<p>
- The people in the following list all made contributions in the form of reviews,
- user feedback, design suggestions, or defect detection:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- Thorsten Ottosen: review management, design advice, documentation feedback
- </li>
-<li class="listitem">
- Eric Niebler: feedback
- </li>
-<li class="listitem">
- Joel de Guzman: review
- </li>
-<li class="listitem">
- Mathias Gaunard: review
- </li>
-<li class="listitem">
- David Abrahams: implementation advice
- </li>
-<li class="listitem">
- Robert Jones: defect reports, usage feedback
- </li>
-<li class="listitem">
- Sean Parent: contributed experience from the Adobe range library
- </li>
-<li class="listitem">
- Arno Schoedl: implementations, and review
- </li>
-<li class="listitem">
- Rogier van Dalen: review
- </li>
-<li class="listitem">
- Vincente Botet: review, documentation feedback
- </li>
-</ul></div>
-<p>
- Regardless of how I write this section it will never truly fairly capture the
- gratitude that I feel to all who have contributed. Thank you everyone.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="faq.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/introduction.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,154 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="next" href="concepts.html" title="Range Concepts">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
-</h2></div></div></div>
-<p>
- Generic algorithms have so far been specified in terms of two or more iterators.
- Two iterators would together form a range of values that the algorithm could
- work on. This leads to a very general interface, but also to a somewhat clumsy
- use of the algorithms with redundant specification of container names. Therefore
- we would like to raise the abstraction level for algorithms so they specify
- their interface in terms of <a class="link" href="concepts.html" title="Range Concepts">Ranges</a> as
- much as possible.
- </p>
-<p>
- The most common form of ranges used throughout the C++ community are standard
- library containers. When writing algorithms however, one often finds it desirable
- for the algorithm to accept other types that offer enough functionality to
- satisfy the needs of the generic code <span class="bold"><strong><span class="emphasis"><em>if a
- suitable layer of indirection is applied</em></span></strong></span> . For example,
- raw arrays are often suitable for use with generic code that works with containers,
- provided a suitable adapter is used. Likewise, null terminated strings can
- be treated as containers of characters, if suitably adapted.
- </p>
-<p>
- This library therefore provides the means to adapt standard-like containers,
- null terminated strings, <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pairs</span></code> of
- iterators, and raw arrays (and more), such that the same generic code can work
- with them all. The basic idea is to add another layer of indirection using
- metafunctions
- and free-standing functions so syntactic and/or semantic differences can be
- removed.
- </p>
-<p>
- The main advantages are
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- simpler implementation and specification of generic range algorithms
- </li>
-<li class="listitem">
- more flexible, compact and maintainable client code
- </li>
-<li class="listitem">
- safe use of built-in arrays (for legacy code; why else would you use built-in
- arrays?)
- </li>
-</ul></div>
-<p>
- Below are given a small example (the complete example can be found here
- ):
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="comment">//
-</span><span class="comment">// example: extracting bounds in a generic algorithm
-</span><span class="comment">//
-</span><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</span><span class="special">(</span> <span class="identifier">ForwardReadableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span> <span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">),</span> <span class="identifier">value</span> <span class="special">);</span>
-<span class="special">}</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span> <span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">),</span> <span class="identifier">value</span> <span class="special">);</span>
-<span class="special">}</span>
-
-<span class="comment">//
-</span><span class="comment">// replace first value and return its index
-</span><span class="comment">//
-</span><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableWriteableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableWriteableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">ForwardReadableWriteableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">replacement</span> <span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableWriteableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">found</span> <span class="special">=</span> <span class="identifier">find</span><span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">value</span> <span class="special">);</span>
-
- <span class="keyword">if</span><span class="special">(</span> <span class="identifier">found</span> <span class="special">!=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">)</span> <span class="special">)</span>
- <span class="special">*</span><span class="identifier">found</span> <span class="special">=</span> <span class="identifier">replacement</span><span class="special">;</span>
- <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">c</span> <span class="special">),</span> <span class="identifier">found</span> <span class="special">);</span>
-<span class="special">}</span>
-
-<span class="comment">//
-</span><span class="comment">// usage
-</span><span class="comment">//
-</span><span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">N</span> <span class="special">=</span> <span class="number">5</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">my_vector</span><span class="special">;</span>
-<span class="keyword">int</span> <span class="identifier">values</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span> <span class="special">};</span>
-
-<span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span> <span class="identifier">values</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">values</span> <span class="special">)</span> <span class="special">);</span>
-<span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">iterator</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">my_view</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">my_vector</span> <span class="special">),</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">my_vector</span> <span class="special">)</span> <span class="special">+</span> <span class="identifier">N</span> <span class="special">);</span>
-<span class="keyword">char</span> <span class="identifier">str_val</span><span class="special">[]</span> <span class="special">=</span> <span class="string">"a string"</span><span class="special">;</span>
-<span class="keyword">char</span><span class="special">*</span> <span class="identifier">str</span> <span class="special">=</span> <span class="identifier">str_val</span><span class="special">;</span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">my_vector</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">2</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">my_view</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">2</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="char">'a'</span><span class="special">,</span> <span class="char">'b'</span> <span class="special">);</span>
-
-<span class="comment">// prints '3', '5' and '0'
-</span></pre>
-<p>
- </p>
-<p>
- By using the free-standing functions and metafunctions,
- the code automatically works for all the types supported by this library; now
- and in the future. Notice that we have to provide two versions of <code class="computeroutput"><span class="identifier">find</span><span class="special">()</span></code> since
- we cannot forward a non-const rvalue with reference arguments (see this article
- about <a href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">The
- Forwarding Problem</a> ).
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Library Headers</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="style_guide.html" title="Terminology and style guidelines">
-<link rel="next" href="library_headers/general.html" title="General">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers/general.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Library Headers">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.library_headers"></a><a class="link" href="library_headers.html" title="Library Headers">Library Headers</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">General</span></dt>
-<dt><span class="section">Adaptors</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-<dt><span class="section"><a href="library_headers/algorithm_extensions.html">Algorithm
- Extensions</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers/general.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/adaptors.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,232 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Adaptors</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../library_headers.html" title="Library Headers">
-<link rel="prev" href="general.html" title="General">
-<link rel="next" href="algorithm.html" title="Algorithm">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="general.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Adaptors">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.library_headers.adaptors"></a><a class="link" href="adaptors.html" title="Adaptors">Adaptors</a>
-</h3></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Header
- </p>
- </th>
-<th>
- <p>
- Includes
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">copied</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/copied.html" title="copied">copied</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/filtered.html" title="filtered">filtered</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indexed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/indexed.html" title="indexed">indexed</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">.</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/indirected.html" title="indirected">indirected</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/map_keys.html" title="map_keys">map_keys</a>
- <a class="link" href="../reference/adaptors/reference/map_values.html" title="map_values">map_values</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/replaced.html" title="replaced">replaced</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/replaced_if.html" title="replaced_if">replaced_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">reversed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/reversed.html" title="reversed">reversed</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">sliced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/sliced.html" title="sliced">sliced</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">strided</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/strided.html" title="strided">strided</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">tokenized</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/tokenized.html" title="tokenized">tokenized</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">transformed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/transformed.html" title="transformed">transformed</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">uniqued</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/adaptors/reference/uniqued.html" title="uniqued">uniqued</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="general.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,683 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../library_headers.html" title="Library Headers">
-<link rel="prev" href="adaptors.html" title="Adaptors">
-<link rel="next" href="algorithm_extensions.html" title="Algorithm Extensions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm_extensions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Algorithm">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.library_headers.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
-</h3></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Header
- </p>
- </th>
-<th>
- <p>
- Includes
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/adjacent_find.html" title="adjacent_find">adjacent_find</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/binary_search.html" title="binary_search">binary_search</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/copy.html" title="copy">copy</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/copy_backward.html" title="copy_backward">copy_backward</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/count.html" title="count">count</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/count_if.html" title="count_if">count_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/equal.html" title="equal">equal</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/equal_range.html" title="equal_range">equal_range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/fill.html" title="fill">fill</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill_n</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/fill_n.html" title="fill_n">fill_n</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/find.html" title="find">find</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/find_end.html" title="find_end">find_end</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/find_first_of.html" title="find_first_of">find_first_of</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/find_if.html" title="find_if">find_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/for_each.html" title="for_each">for_each</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">generate</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/generate.html" title="generate">generate</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/heap/push_heap.html" title="push_heap">push_heap</a>
- <a class="link" href="../reference/algorithms/heap/pop_heap.html" title="pop_heap">pop_heap</a>
- <a class="link" href="../reference/algorithms/heap/make_heap.html" title="make_heap">make_heap</a>
- <a class="link" href="../reference/algorithms/heap/sort_heap.html" title="sort_heap">sort_heap</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/inplace_merge.html" title="inplace_merge">inplace_merge</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/lower_bound.html" title="lower_bound">lower_bound</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/max_element.html" title="max_element">max_element</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">merge</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/merge.html" title="merge">merge</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/min_element.html" title="min_element">min_element</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/mismatch.html" title="mismatch">mismatch</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">nth_element</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/nth_element.html" title="nth_element">nth_element</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/partial_sort.html" title="partial_sort">partial_sort</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partition</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/partition.html" title="partition">partition</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/permutation/next_permutation.html" title="next_permutation">next_permutation</a>
- <a class="link" href="../reference/algorithms/permutation/prev_permutation.html" title="prev_permutation">prev_permutation</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/random_shuffle.html" title="random_shuffle">random_shuffle</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/remove.html" title="remove">remove</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/remove_copy.html" title="remove_copy">remove_copy</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/remove_copy_if.html" title="remove_copy_if">remove_copy_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/remove_if.html" title="remove_if">remove_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/replace.html" title="replace">replace</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/replace_copy.html" title="replace_copy">replace_copy</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/replace_copy_if.html" title="replace_copy_if">replace_copy_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/replace_if.html" title="replace_if">replace_if</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/reverse.html" title="reverse">reverse</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse_copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/reverse_copy.html" title="reverse_copy">reverse_copy</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/rotate.html" title="rotate">rotate</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate_copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/rotate_copy.html" title="rotate_copy">rotate_copy</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/search.html" title="search">search</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/search_n.html" title="search_n">search_n</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/set/includes.html" title="includes">includes</a>
- <a class="link" href="../reference/algorithms/set/set_union.html" title="set_union">set_union</a>
- <a class="link" href="../reference/algorithms/set/set_intersection.html" title="set_intersection">set_intersection</a>
- <a class="link" href="../reference/algorithms/set/set_difference.html" title="set_difference">set_difference</a>
- <a class="link" href="../reference/algorithms/set/set_symmetric_difference.html" title="set_symmetric_difference">set_symmetric_difference</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">sort</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/sort.html" title="sort">sort</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/stable_partition.html" title="stable_partition">stable_partition</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">swap_ranges</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/swap_ranges.html" title="swap_ranges">swap_ranges</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transform</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/transform.html" title="transform">transform</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/unique.html" title="unique">unique</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique_copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/mutating/unique_copy.html" title="unique_copy">unique_copy</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/non_mutating/upper_bound.html" title="upper_bound">upper_bound</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm_extensions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/algorithm_extensions.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,172 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Algorithm Extensions</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../library_headers.html" title="Library Headers">
-<link rel="prev" href="algorithm.html" title="Algorithm">
-<link rel="next" href="../examples.html" title="Examples">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Algorithm Extensions">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.library_headers.algorithm_extensions"></a><a class="link" href="algorithm_extensions.html" title="Algorithm Extensions">Algorithm
- Extensions</a>
-</h3></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Header
- </p>
- </th>
-<th>
- <p>
- Includes
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/copy_n.html" title="copy_n">copy_n</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/erase.html" title="erase">erase</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/for_each.html" title="for_each">for_each</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/insert.html" title="insert">insert</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/iota.html" title="iota">iota</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/is_sorted.html" title="is_sorted">is_sorted</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/overwrite.html" title="overwrite">overwrite</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/push_back.html" title="push_back">push_back</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/algorithms/new/push_front.html" title="push_front">push_front</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/library_headers/general.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,551 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>General</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../library_headers.html" title="Library Headers">
-<link rel="prev" href="../library_headers.html" title="Library Headers">
-<link rel="next" href="adaptors.html" title="Adaptors">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../library_headers.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="General">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.library_headers.general"></a><a class="link" href="general.html" title="General">General</a>
-</h3></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Header
- </p>
- </th>
-<th>
- <p>
- Includes
- </p>
- </th>
-<th>
- <p>
- Related Concept
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- everything from Boost.Range version 1 (Boost versions 1.42 and
- below). Includes the core range functions and metafunctinos, but
- excludes Range Adaptors and Range Algorithms.
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">metafunctions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- every metafunction
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">functions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- every function
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">value_type</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_value</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_iterator</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">difference_type</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_difference</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">pointer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_pointer</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">category</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_category</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">reverse_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_reverse_iterator</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">begin</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">end</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">empty</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">empty</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">distance</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">size</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">rbegin</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">rbegin</span></code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_rbegin</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">rend</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">rend</span></code></a> and <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_rend</span></code></a>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">as_array</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_array</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">as_literal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">sub_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">concepts</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts.html" title="Range Concepts">Range concepts</a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- every range adaptor
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- every range equivalent of an STL algorithm
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- every range algorithm that is an extension of the STL algorithms
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">counting_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/ranges/counting_range.html" title="counting_range"><code class="computeroutput"><span class="identifier">counting_range</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">istream_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/ranges/istream_range.html" title="istream_range"><code class="computeroutput"><span class="identifier">istream_range</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">irange</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/ranges/irange.html" title="irange"><code class="computeroutput"><span class="identifier">irange</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">join</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../reference/utilities/join.html" title="Function join"><code class="computeroutput"><span class="identifier">join</span></code></a>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../library_headers.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>MFC/ATL (courtesy of Shunsuke Sogame)</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="examples.html" title="Examples">
-<link rel="next" href="mfc_atl/requirements.html" title="Requirements">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="examples.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl/requirements.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.mfc_atl"></a><a class="link" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)"> MFC/ATL (courtesy of Shunsuke Sogame)</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"> Requirements</span></dt>
-<dt><span class="section"> MFC Ranges</span></dt>
-<dt><span class="section"> ATL Ranges</span></dt>
-<dt><span class="section"> const Ranges</span></dt>
-<dt><span class="section"> References</span></dt>
-</dl></div>
-<a name="range.mfc_atl.introduction"></a><h5>
-<a name="id681998"></a>
- <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
- </h5>
-<p>
- This implementation was kindly donated by Shunsuke Sogame. This header adapts
- MFC and ATL containers to the appropriate Range concepts.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr></tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <span class="bold"><strong>Author:</strong></span>
- </p>
- </td>
-<td>
- <p>
- Shunsuke Sogame
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <span class="bold"><strong>Contact:</strong></span>
- </p>
- </td>
-<td>
- <p>
- mb2act_at_[hidden]
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <span class="bold"><strong>Date:</strong></span>
- </p>
- </td>
-<td>
- <p>
- 26th of May 2006
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <span class="bold"><strong>Copyright:</strong></span>
- </p>
- </td>
-<td>
- <p>
- Shunsuke Sogame 2005-2006. Use, modification and distribution is
- subject to the Boost Software License, Version 1.0
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<a name="range.mfc_atl.overview"></a><h5>
-<a name="id682134"></a>
- <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
- </h5>
-<p>
- Boost.Range MFC/ATL Extension provides Boost.Range support for MFC/ATL collection
- and string types.
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">CTypedPtrArray</span><span class="special">&lt;</span><span class="identifier">CPtrArray</span><span class="special">,</span> <span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">CString</span><span class="special">&gt;</span> <span class="special">*&gt;</span> <span class="identifier">myArray</span><span class="special">;</span>
-<span class="special">...</span>
-<span class="identifier">BOOST_FOREACH</span> <span class="special">(</span><span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">CString</span><span class="special">&gt;</span> <span class="special">*</span><span class="identifier">theList</span><span class="special">,</span> <span class="identifier">myArray</span><span class="special">)</span>
-<span class="special">{</span>
- <span class="identifier">BOOST_FOREACH</span> <span class="special">(</span><span class="identifier">CString</span><span class="special">&amp;</span> <span class="identifier">str</span><span class="special">,</span> <span class="special">*</span><span class="identifier">theList</span><span class="special">)</span>
- <span class="special">{</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">to_upper</span><span class="special">(</span><span class="identifier">str</span><span class="special">);</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">str</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">str</span><span class="special">));</span>
- <span class="special">...</span>
- <span class="special">}</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="examples.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl/requirements.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/atl_ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,374 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>ATL Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
-<link rel="next" href="const_ranges.html" title="const Ranges">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="const_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="ATL Ranges">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.atl_ranges"></a><a class="link" href="atl_ranges.html" title="ATL Ranges"> ATL Ranges</a>
-</h3></div></div></div>
-<p>
- If the <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">atl</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- is included before or after Boost.Range headers, the ATL collections and
- strings become models of Range. The table below lists the Traversal Category
- and <code class="computeroutput"><span class="identifier">range_reference</span></code> of ATL
- ranges.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Range
- </p>
- </th>
-<th>
- <p>
- Traversal Category
- </p>
- </th>
-<th>
- <p>
- <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CAtlArray</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">,</span><span class="identifier">ET</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CAutoPtrArray</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CInterfaceArray</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CComQIPtr</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CAtlList</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">,</span><span class="identifier">ET</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CAutoPtrList</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CHeapPtrList</span><span class="special">&lt;</span><span class="identifier">E</span><span class="special">,</span><span class="identifier">A</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">E</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CInterfaceList</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CComQIPtr</span><span class="special">&lt;</span><span class="identifier">I</span><span class="special">,</span><span class="identifier">pi</span><span class="special">&gt;&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CAtlMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CRBTree</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CRBMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CRBMultiMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">V</span><span class="special">,</span><span class="identifier">KT</span><span class="special">,</span><span class="identifier">VT</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CSimpleStringT</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">b</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">B</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CStringT</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">ST</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">B</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CFixedStringT</span><span class="special">&lt;</span><span class="identifier">S</span><span class="special">,</span><span class="identifier">n</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">S</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CComBSTR</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">OLECHAR</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CSimpleArray</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">TE</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">T</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- Other <a class="link" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">Boost.Range</a> metafunctions are defined
- by the following. Let <code class="computeroutput"><span class="identifier">Range</span></code>
- be any type listed above and <code class="computeroutput"><span class="identifier">Ref</span></code>
- be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span></code>,
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span></code>,
- and <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">add_pointer</span><span class="special">&lt;</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- As for <code class="computeroutput"><span class="keyword">const</span> <span class="identifier">Range</span></code>,
- see below.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="const_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/const_ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,125 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>const Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<link rel="prev" href="atl_ranges.html" title="ATL Ranges">
-<link rel="next" href="references.html" title="References">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="atl_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="const Ranges">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.const_ranges"></a><a class="link" href="const_ranges.html" title="const Ranges"> const Ranges</a>
-</h3></div></div></div>
-<p>
- <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- is defined by the following algorithm. Let <code class="computeroutput"><span class="identifier">Range</span></code>
- be any type listed above and <code class="computeroutput"><span class="identifier">Ref</span></code>
- be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObList</span><span class="special">)</span>
- <span class="keyword">return</span> <span class="identifier">CObject</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&amp;</span>
-<span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CPtrArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CPtrList</span><span class="special">)</span>
- <span class="keyword">return</span> <span class="keyword">void</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&amp;</span>
-<span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">there</span> <span class="identifier">is</span> <span class="identifier">a</span> <span class="identifier">type</span> <span class="identifier">X</span> <span class="identifier">such</span> <span class="identifier">that</span> <span class="identifier">X</span><span class="special">&amp;</span> <span class="identifier">is</span> <span class="identifier">the</span> <span class="identifier">same</span> <span class="identifier">as</span> <span class="identifier">Ref</span><span class="special">)</span>
- <span class="keyword">return</span> <span class="identifier">X</span> <span class="keyword">const</span> <span class="special">&amp;</span>
-<span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">there</span> <span class="identifier">is</span> <span class="identifier">a</span> <span class="identifier">type</span> <span class="identifier">X</span> <span class="identifier">such</span> <span class="identifier">that</span> <span class="identifier">X</span><span class="special">*</span> <span class="keyword">const</span> <span class="identifier">is</span> <span class="identifier">the</span> <span class="identifier">same</span> <span class="identifier">as</span> <span class="identifier">Ref</span><span class="special">)</span>
- <span class="keyword">return</span> <span class="identifier">X</span> <span class="keyword">const</span> <span class="special">*</span> <span class="keyword">const</span>
-<span class="keyword">else</span>
- <span class="keyword">return</span> <span class="identifier">Ref</span>
-</pre>
-<p>
- </p>
-<p>
- Other Boost.Range metafunctions are defined by the following.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Range metafunction
- </p>
- </th>
-<th>
- <p>
- Result
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">add_pointer</span><span class="special">&lt;</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="atl_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/mfc_ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,480 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>MFC Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<link rel="prev" href="requirements.html" title="Requirements">
-<link rel="next" href="atl_ranges.html" title="ATL Ranges">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="requirements.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="atl_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="MFC Ranges">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.mfc_ranges"></a><a class="link" href="mfc_ranges.html" title="MFC Ranges"> MFC Ranges</a>
-</h3></div></div></div>
-<p>
- If the <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">mfc</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
- is included before or after Boost.Range headers, the MFC collections and
- strings become models of Range. The table below lists the Traversal Category
- and <code class="computeroutput"><span class="identifier">range_reference</span></code> of MFC
- ranges.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Range
- </p>
- </th>
-<th>
- <p>
- Traversal Category
- </p>
- </th>
-<th>
- <p>
- <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CArray</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">A</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">T</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">A</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">T</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMap</span><span class="special">&lt;</span><span class="identifier">K</span><span class="special">,</span><span class="identifier">AK</span><span class="special">,</span><span class="identifier">M</span><span class="special">,</span><span class="identifier">AM</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CTypedPtrArray</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">T</span><span class="special">*&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">T</span><span class="special">*</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CTypedPtrList</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">T</span><span class="special">*&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">T</span><span class="special">*</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CTypedPtrMap</span><span class="special">&lt;</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">T</span><span class="special">*,</span><span class="identifier">V</span><span class="special">*&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">*,</span><span class="identifier">V</span><span class="special">*&gt;</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CByteArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">BYTE</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CDWordArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">DWORD</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CObArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CObject</span><span class="special">*&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CPtrArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="keyword">void</span><span class="special">*&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CStringArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CString</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CUIntArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">UINT</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CWordArray</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">WORD</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CObList</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CObject</span><span class="special">*&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CPtrList</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="keyword">void</span><span class="special">*&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CStringList</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CString</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMapPtrToWord</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">void</span><span class="special">*,</span><span class="identifier">WORD</span><span class="special">&gt;</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMapPtrToPtr</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">void</span><span class="special">*,</span><span class="keyword">void</span><span class="special">*&gt;</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMapStringToOb</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">String</span><span class="special">,</span><span class="identifier">CObject</span><span class="special">*&gt;</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMapStringToString</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">Range</span><span class="special">::</span><span class="identifier">CPair</span><span class="special">&amp;</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMapWordToOb</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">WORD</span><span class="special">,</span><span class="identifier">CObject</span><span class="special">*&gt;</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">CMapWordToPtr</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">WORD</span><span class="special">,</span><span class="keyword">void</span><span class="special">*&gt;</span>
- <span class="keyword">const</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- Other Boost.Range metafunctions are defined by the following. Let <code class="computeroutput"><span class="identifier">Range</span></code> be any type listed above and <code class="computeroutput"><span class="identifier">Ref</span></code> be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">remove_const</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>,
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span></code>,
- and <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">add_pointer</span><span class="special">&lt;</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Ref</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- As for <code class="computeroutput"><span class="keyword">const</span> <span class="identifier">Range</span></code>,
- see below.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="requirements.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="atl_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/references.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<link rel="prev" href="const_ranges.html" title="const Ranges">
-<link rel="next" href="../upgrade.html" title="Upgrade version of Boost.Range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="const_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../upgrade.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="References">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.references"></a><a class="link" href="references.html" title="References"> References</a>
-</h3></div></div></div>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem"><a class="link" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">Boost.Range</a></li>
-<li class="listitem"><a href="http://msdn.microsoft.com/en-us/library/942860sh.aspx" target="_top">MFC
- Collection Classes</a></li>
-<li class="listitem"><a href="http://msdn.microsoft.com/en-us/library/15e672bd.aspx" target="_top">ATL
- Collection Classes</a></li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="const_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../upgrade.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/mfc_atl/requirements.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,51 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Requirements</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
-<link rel="next" href="mfc_ranges.html" title="MFC Ranges">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Requirements">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.requirements"></a><a class="link" href="requirements.html" title="Requirements"> Requirements</a>
-</h3></div></div></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- Boost C++ Libraries Version 1.34.0 or later (no compilation required)
- </li>
-<li class="listitem">
- Visual C++ 7.1 or later (for MFC and ATL)
- </li>
-</ul></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/portability.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/portability.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,91 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Portability</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
-<link rel="next" href="faq.html" title="FAQ">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="upgrade/upgrade_from_1_34.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Portability">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.portability"></a><a class="link" href="portability.html" title="Portability">Portability</a>
-</h2></div></div></div>
-<p>
- A huge effort has been made to port the library to as many compilers as possible.
- </p>
-<p>
- Full support for built-in arrays require that the compiler supports class template
- partial specialization. For non-conforming compilers there might be a chance
- that it works anyway thanks to workarounds in the type traits library. Visual
- C++ 6/7.0 has a limited support for arrays: as long as the arrays are of built-in
- type it should work.
- </p>
-<p>
- Notice also that some compilers cannot do function template ordering properly.
- In that case one must rely of <a class="link" href="reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_iterator</span></code></a> and a single function
- definition instead of overloaded versions for const and non-const arguments.
- So if one cares about old compilers, one should not pass rvalues to the functions.
- </p>
-<p>
- For maximum portability you should follow these guidelines:
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
- do not use built-in arrays,
- </li>
-<li class="listitem">
- do not pass rvalues to <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>,
- <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
- and <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> Range constructors
- and assignment operators,
- </li>
-<li class="listitem">
- use <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>
- and <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
- whenever your code by intention is read-only; this will also solve most rvalue
- problems,
- </li>
-<li class="listitem">
- do not rely on ADL:
- <div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- if you overload functions, include that header before the headers in
- this library,
- </li>
-<li class="listitem">
- put all overloads in namespace boost.
- </li>
-</ul></div>
-</li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="upgrade/upgrade_from_1_34.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,95 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Reference</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="concepts/concept_checking.html" title="Concept Checking">
-<link rel="next" href="reference/overview.html" title="Overview">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="concepts/concept_checking.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Reference">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Overview</span></dt>
-<dt><span class="section"><a href="reference/concept_implementation.html"> Range concept
- implementation</a></span></dt>
-<dd><dl>
-<dt><span class="section">Synopsis</span></dt>
-<dt><span class="section">Semantics</span></dt>
-</dl></dd>
-<dt><span class="section"> Range Adaptors</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="reference/adaptors/introduction.html"> Introduction
- and motivation</a></span></dt>
-<dt><span class="section"><a href="reference/adaptors/general_requirements.html"> General
- Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
-</dl></dd>
-<dt><span class="section"> Range Algorithm</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="reference/algorithms/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"> Mutating algorithms</span></dt>
-<dt><span class="section"><a href="reference/algorithms/non_mutating.html"> Non-mutating
- algorithms</a></span></dt>
-<dt><span class="section"> Set algorithms</span></dt>
-<dt><span class="section"> Heap algorithms</span></dt>
-<dt><span class="section"><a href="reference/algorithms/permutation.html"> Permutation
- algorithms</a></span></dt>
-<dt><span class="section"> New algorithms</span></dt>
-<dt><span class="section"> Numeric algorithms</span></dt>
-</dl></dd>
-<dt><span class="section"> Provided Ranges</span></dt>
-<dd><dl>
-<dt><span class="section"> counting_range</span></dt>
-<dt><span class="section"> istream_range</span></dt>
-<dt><span class="section"> irange</span></dt>
-</dl></dd>
-<dt><span class="section"> Utilities</span></dt>
-<dd><dl>
-<dt><span class="section"> Class iterator_range</span></dt>
-<dt><span class="section"> Class sub_range</span></dt>
-<dt><span class="section"> Function join</span></dt>
-</dl></dd>
-<dt><span class="section"> Extending the library</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="reference/extending/method_1.html"> Method 1: provide
- member functions and nested types</a></span></dt>
-<dt><span class="section"><a href="reference/extending/method_2.html"> Method 2: provide
- free-standing functions and specialize metafunctions</a></span></dt>
-<dt><span class="section"><a href="reference/extending/method_3.html"> Method 3: provide
- range adaptor implementations</a></span></dt>
-</dl></dd>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="concepts/concept_checking.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Adaptors</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="concept_implementation/semantics/functions.html" title="Functions">
-<link rel="next" href="adaptors/introduction.html" title="Introduction and motivation">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Adaptors">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.adaptors"></a><a class="link" href="adaptors.html" title="Range Adaptors"> Range Adaptors</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="adaptors/introduction.html"> Introduction
- and motivation</a></span></dt>
-<dt><span class="section"><a href="adaptors/general_requirements.html"> General
- Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/general_requirements.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>General Requirements</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="introduction.html" title="Introduction and motivation">
-<link rel="next" href="reference.html" title="Reference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="General Requirements">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.general_requirements"></a><a class="link" href="general_requirements.html" title="General Requirements"> General
- Requirements</a>
-</h4></div></div></div>
-<p>
- In the description of generator expressions, the following notation is
- used:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">fwdRng</span></code> is an expression
- of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
- <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">biRng</span></code> is an expression
- of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
- <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">rndRng</span></code> is an expression
- of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
- <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">pred</span></code> is an expression
- of a type that models <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">bi_pred</span></code> is an expression
- of a type that models <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">fun</span></code> is an expression
- of a type that models <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">value</span></code>, <code class="computeroutput"><span class="identifier">new_value</span></code> and <code class="computeroutput"><span class="identifier">old_value</span></code>
- are objects convertible to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span></code> are integer expressions convertible
- to <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
-</ul></div>
-<p>
- Also note that <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code> must be implicitly convertible to
- the type arguments to <code class="computeroutput"><span class="identifier">pred</span></code>,
- <code class="computeroutput"><span class="identifier">bi_pred</span></code> and <code class="computeroutput"><span class="identifier">fun</span></code>.
- </p>
-<p>
- Range Category in the following adaptor descriptions refers to the minimum
- range concept required by the range passed to the adaptor. The resultant
- range is a model of the same range concept as the input range unless specified
- otherwise.
- </p>
-<p>
- Returned Range Category is the concept of the returned range. In some cases
- the returned range is of a lesser category than the range passed to the
- adaptor. For example, the <code class="computeroutput"><span class="identifier">filtered</span></code>
- adaptor returns only a <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
- regardless of the input.
- </p>
-<p>
- Furthermore, the following rules apply to any expression of the form
-</p>
-<pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adaptor_generator</span>
-</pre>
-<p>
- </p>
-<p>
- 1. Applying <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- to a range <code class="computeroutput"><span class="identifier">R</span></code> (always left
- argument) and a range adapter <code class="computeroutput"><span class="identifier">RA</span></code>
- (always right argument) yields a new range type which may not conform to
- the same range concept as <code class="computeroutput"><span class="identifier">R</span></code>.
- </p>
-<p>
- 2. The return-type of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code> is otherwise unspecified.
- </p>
-<p>
- 3. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- is found by Argument Dependent Lookup (ADL) because a range adaptor is
- implemented in namespace <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span></code>.
- </p>
-<p>
- 4. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- is used to add new behaviour <span class="emphasis"><em><span class="bold"><strong>lazily</strong></span></em></span>
- and never modifies its left argument.
- </p>
-<p>
- 5. All iterators extracted from the left argument are extracted using qualified
- calls to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">()</span></code>
- and <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">()</span></code>.
- </p>
-<p>
- 6. In addition to the <code class="computeroutput"><span class="keyword">throw</span></code>-clauses
- below, <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- may throw exceptions as a result of copying iterators. If such copying
- cannot throw an exception, then neither can the whole expression.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/introduction.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,274 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction and motivation</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="../adaptors.html" title="Range Adaptors">
-<link rel="next" href="general_requirements.html" title="General Requirements">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction and motivation">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation"> Introduction
- and motivation</a>
-</h4></div></div></div>
-<p>
- A <span class="bold"><strong>Range Adaptor</strong></span> is a class that wraps
- an existing Range to provide a new Range with different behaviour. Since
- the behaviour of Ranges is determined by their associated iterators, a
- Range Adaptor simply wraps the underlying iterators with new special iterators.
- In this example
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- the iterators from <code class="computeroutput"><span class="identifier">vec</span></code>
- are wrapped <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>s.
- The type of the underlying Range Adapter is not documented because you
- do not need to know it. All that is relevant is that the expression
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
-</pre>
-<p>
- </p>
-<p>
- returns a Range Adaptor where the iterator type is now the iterator type
- of the range <code class="computeroutput"><span class="identifier">vec</span></code> wrapped
- in <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>. The
- expression <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span></code> is called an <span class="bold"><strong>Adaptor
- Generator</strong></span>.
- </p>
-<p>
- There are two ways of constructing a range adaptor. The first is by using
- <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
- This is my preferred technique, however while discussing range adaptors
- with others it became clear that some users of the library strongly prefer
- a more familiar function syntax, so equivalent functions of the present
- tense form have been added as an alternative syntax. The equivalent to
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">reversed</span></code> is <code class="computeroutput"><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> for example.
- </p>
-<p>
- Why do I prefer the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code> syntax? The answer is readability:
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- This might not look so bad, but when we apply several adaptors, it becomes
- much worse. Just compare
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">)</span> <span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- to
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
- <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">uniqued</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- Furthermore, some of the adaptor generators take arguments themselves and
- these arguments are expressed with function call notation too. In those
- situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
- </p>
-<a name="range.reference.adaptors.introduction.composition_of_adaptors"></a><h6>
-<a name="id567043"></a>
- <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
- of Adaptors</a>
- </h6>
-<p>
- Range Adaptors are a powerful complement to Range algorithms. The reason
- is that adaptors are <span class="emphasis"><em><span class="bold"><strong>orthogonal</strong></span></em></span>
- to algorithms. For example, consider these Range algorithms:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">)</span></code></li>
-</ul></div>
-<p>
- What should we do if we only want to copy an element <code class="computeroutput"><span class="identifier">a</span></code>
- if it satisfies some predicate, say <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>?
- And what if we only want to count the elements that satisfy the same predicate?
- The naive answer would be to use these algorithms:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span>
- <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">pred</span><span class="special">,</span>
- <span class="identifier">out</span> <span class="special">)</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span>
- <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">pred</span> <span class="special">)</span></code></li>
-</ul></div>
-<p>
- These algorithms are only defined to maintain a one to one relationship
- with the standard library algorithms. This approach of adding algorithm
- suffers a combinatorial explosion. Inevitably many algorithms are missing
- <code class="computeroutput"><span class="identifier">_if</span></code> variants and there
- is redundant development overhead for each new algorithm. The Adaptor Generator
- is the design solution to this problem.
- </p>
-<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id567347"></a>
- <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
- Adaptor alternative to copy_if algorithm</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">);</span>
-</pre>
-<p>
- can be expressed as
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id567512"></a>
- <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm">Range
- Adaptor alternative to count_if algorithm</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">);</span>
-</pre>
-<p>
- can be expressed as
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- What this means is that <span class="emphasis"><em><span class="bold"><strong>no</strong></span></em></span>
- algorithm with the <code class="computeroutput"><span class="identifier">_if</span></code>
- suffix is needed. Furthermore, it turns out that algorithms with the <code class="computeroutput"><span class="identifier">_copy</span></code> suffix are not needed either. Consider
- the somewhat misdesigned <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">()</span></code> which may be used as
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- With adaptors and algorithms we can express this as
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">));</span>
-</pre>
-<p>
- </p>
-<p>
- The latter code has several benefits:
- </p>
-<p>
- 1. it is more <span class="emphasis"><em><span class="bold"><strong>efficient</strong></span></em></span>
- because we avoid extra allocations as might happen with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span></code>
- </p>
-<p>
- 2. it is <span class="emphasis"><em><span class="bold"><strong>flexible</strong></span></em></span>
- as we can subsequently apply even more adaptors, for example:
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
- <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- 3. it is <span class="emphasis"><em><span class="bold"><strong>safer</strong></span></em></span> because
- there is no use of an unbounded output iterator.
- </p>
-<p>
- In this manner, the <span class="emphasis"><em><span class="bold"><strong>composition</strong></span></em></span>
- of Range Adaptors has the following consequences:
- </p>
-<p>
- 1. we no longer need <code class="computeroutput"><span class="identifier">_if</span></code>,
- <code class="computeroutput"><span class="identifier">_copy</span></code>, <code class="computeroutput"><span class="identifier">_copy_if</span></code>
- and <code class="computeroutput"><span class="identifier">_n</span></code> variants of algorithms.
- </p>
-<p>
- 2. we can generate a multitude of new algorithms on the fly, for example,
- above we generated <code class="computeroutput"><span class="identifier">reverse_replace_copy_if</span><span class="special">()</span></code>
- </p>
-<p>
- In other words:
- </p>
-<p>
- <span class="bold"><strong>Range Adaptors are to algorithms what algorithms
- are to containers</strong></span>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,63 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Reference</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="general_requirements.html" title="General Requirements">
-<link rel="next" href="reference/adjacent_filtered.html" title="adjacent_filtered">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="general_requirements.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Reference">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="reference/adjacent_filtered.html">
- adjacent_filtered</a></span></dt>
-<dt><span class="section"> copied</span></dt>
-<dt><span class="section"> filtered</span></dt>
-<dt><span class="section"> indexed</span></dt>
-<dt><span class="section"> indirected</span></dt>
-<dt><span class="section"> map_keys</span></dt>
-<dt><span class="section"> map_values</span></dt>
-<dt><span class="section"> replaced</span></dt>
-<dt><span class="section"><a href="reference/replaced_if.html">
- replaced_if</a></span></dt>
-<dt><span class="section"> reversed</span></dt>
-<dt><span class="section"> sliced</span></dt>
-<dt><span class="section"> strided</span></dt>
-<dt><span class="section"> tokenized</span></dt>
-<dt><span class="section"><a href="reference/transformed.html">
- transformed</a></span></dt>
-<dt><span class="section"> uniqued</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="general_requirements.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,157 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>adjacent_filtered</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="../reference.html" title="Reference">
-<link rel="next" href="copied.html" title="copied">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copied.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="adjacent_filtered">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">
- adjacent_filtered</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example">
- adjacent_filtered example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">bi_pred</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filter</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">bi_pred</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range is convertible to both argument types of <code class="computeroutput"><span class="identifier">bi_pred</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
- <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">bi_pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
- of <code class="computeroutput"><span class="identifier">bi_pred</span></code> might throw.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
- of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
- and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-</li>
-</ul></div>
-<div class="section" title="adjacent_filtered example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">
- adjacent_filtered example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">functional</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">not_equal_to</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;()),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copied.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/copied.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,156 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>copied</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="adjacent_filtered.html" title="adjacent_filtered">
-<link rel="next" href="filtered.html" title="filtered">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adjacent_filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="filtered.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="copied">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.copied"></a><a class="link" href="copied.html" title="copied"> copied</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="copied.html#range.reference.adaptors.reference.copied.copied_example">
- copied example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">copied</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span>
- <span class="identifier">m</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">n</span><span class="special">,</span>
- <span class="identifier">m</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
- <span class="special">&lt;=</span> <span class="identifier">n</span>
- <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
- <span class="special">&lt;=</span> <span class="identifier">m</span>
- <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
- <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A new <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- that holds the sliced range <code class="computeroutput"><span class="special">[</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span><span class="special">)</span></code>
- of the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-</ul></div>
-<div class="section" title="copied example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.copied.copied_example"></a><a class="link" href="copied.html#range.reference.adaptors.reference.copied.copied_example" title="copied example">
- copied example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">copied</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">copied</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">5</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adjacent_filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="filtered.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/filtered.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,159 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>filtered</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="copied.html" title="copied">
-<link rel="next" href="indexed.html" title="indexed">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copied.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indexed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="filtered">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.filtered"></a><a class="link" href="filtered.html" title="filtered"> filtered</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example">
- filtered example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filter</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">pred</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
- <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
- of <code class="computeroutput"><span class="identifier">pred</span></code> might throw.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
- of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
- and <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
-</li>
-</ul></div>
-<div class="section" title="filtered example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.filtered.filtered_example"></a><a class="link" href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example" title="filtered example">
- filtered example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">struct</span> <span class="identifier">is_even</span>
-<span class="special">{</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="keyword">int</span> <span class="identifier">x</span> <span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">0</span><span class="special">;</span> <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">()),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copied.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indexed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indexed.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,190 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>indexed</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="filtered.html" title="filtered">
-<link rel="next" href="indirected.html" title="indirected">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indirected.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="indexed">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.indexed"></a><a class="link" href="indexed.html" title="indexed"> indexed</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example">
- indexed example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indexed</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">index</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A range adapted to return
- both the element and the associated index. The returned range consists
- of iterators that have in addition to the usual iterator member functions
- an <code class="computeroutput"><span class="identifier">index</span><span class="special">()</span></code>
- member function that returns the appropriate index for the element
- in the sequence corresponding with the iterator.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>
-</li>
-</ul></div>
-<div class="section" title="indexed example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.indexed.indexed_example"></a><a class="link" href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example" title="indexed example">
- indexed example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indexed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Iterator</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">for</span> <span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">it</span> <span class="special">=</span> <span class="identifier">first</span><span class="special">;</span> <span class="identifier">it</span> <span class="special">!=</span> <span class="identifier">last</span><span class="special">;</span> <span class="special">++</span><span class="identifier">it</span><span class="special">)</span>
- <span class="special">{</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"Element = "</span> <span class="special">&lt;&lt;</span> <span class="special">*</span><span class="identifier">it</span> <span class="special">&lt;&lt;</span> <span class="string">" Index = "</span> <span class="special">&lt;&lt;</span> <span class="identifier">it</span><span class="special">.</span><span class="identifier">index</span><span class="special">()</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
- <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">)</span>
-<span class="special">{</span>
- <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">));</span>
-<span class="special">}</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Iterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Iterator2</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">check_element_and_index</span><span class="special">(</span>
- <span class="identifier">Iterator1</span> <span class="identifier">test_first</span><span class="special">,</span>
- <span class="identifier">Iterator1</span> <span class="identifier">test_last</span><span class="special">,</span>
- <span class="identifier">Iterator2</span> <span class="identifier">reference_first</span><span class="special">,</span>
- <span class="identifier">Iterator2</span> <span class="identifier">reference_last</span><span class="special">)</span>
-<span class="special">{</span>
- <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">test_first</span><span class="special">,</span> <span class="identifier">test_last</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">reference_first</span><span class="special">,</span> <span class="identifier">reference_last</span><span class="special">)</span> <span class="special">);</span>
-
- <span class="keyword">int</span> <span class="identifier">reference_index</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
-
- <span class="identifier">Iterator1</span> <span class="identifier">test_it</span> <span class="special">=</span> <span class="identifier">test_first</span><span class="special">;</span>
- <span class="identifier">Iterator2</span> <span class="identifier">reference_it</span> <span class="special">=</span> <span class="identifier">reference_first</span><span class="special">;</span>
- <span class="keyword">for</span> <span class="special">(;</span> <span class="identifier">test_it</span> <span class="special">!=</span> <span class="identifier">test_last</span><span class="special">;</span> <span class="special">++</span><span class="identifier">test_it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">reference_it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">reference_index</span><span class="special">)</span>
- <span class="special">{</span>
- <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="special">*</span><span class="identifier">test_it</span><span class="special">,</span> <span class="special">*</span><span class="identifier">reference_it</span> <span class="special">);</span>
- <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="identifier">test_it</span><span class="special">.</span><span class="identifier">index</span><span class="special">(),</span> <span class="identifier">reference_index</span> <span class="special">);</span>
- <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span><span class="special">;</span>
-
- <span class="identifier">display_element_and_index</span><span class="special">(</span> <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">indexed</span><span class="special">(</span><span class="number">0</span><span class="special">)</span> <span class="special">);</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="identifier">Element</span> <span class="special">=</span> <span class="number">10</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">0</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">20</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">1</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">30</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">2</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">40</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">3</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">50</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">4</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">60</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">5</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">70</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">6</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">80</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">7</span>
-<span class="identifier">Element</span> <span class="special">=</span> <span class="number">90</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">8</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indirected.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/indirected.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,150 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>indirected</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="indexed.html" title="indexed">
-<link rel="next" href="map_keys.html" title="map_keys">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="indexed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_keys.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="indirected">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.indirected"></a><a class="link" href="indirected.html" title="indirected"> indirected</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example">
- indirected example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indirected</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indirect</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range defines unary <code class="computeroutput"><span class="keyword">operator</span><span class="special">*()</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="special">*</span><span class="identifier">y</span></code>
- where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
- element in the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>
-</li>
-</ul></div>
-<div class="section" title="indirected example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.indirected.indirected_example"></a><a class="link" href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example" title="indirected example">
- indirected example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">shared_ptr</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
-
- <span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
- <span class="identifier">input</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="keyword">new</span> <span class="keyword">int</span><span class="special">(</span><span class="identifier">i</span><span class="special">)));</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">indirected</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="indexed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_keys.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,150 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>map_keys</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="indirected.html" title="indirected">
-<link rel="next" href="map_values.html" title="map_values">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="indirected.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_values.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="map_keys">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.map_keys"></a><a class="link" href="map_keys.html" title="map_keys"> map_keys</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example">
- map_keys example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">map_keys</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">keys</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range is an instantiation of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">first</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
- is the corresponding element in the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-</ul></div>
-<div class="section" title="map_keys example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.map_keys.map_keys_example"></a><a class="link" href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example" title="map_keys example">
- map_keys example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">map</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
- <span class="identifier">input</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">make_pair</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">i</span> <span class="special">*</span> <span class="number">10</span><span class="special">));</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">map_keys</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="indirected.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_values.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/map_values.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,150 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>map_values</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="map_keys.html" title="map_keys">
-<link rel="next" href="replaced.html" title="replaced">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="map_keys.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="map_values">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.map_values"></a><a class="link" href="map_values.html" title="map_values"> map_values</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example">
- map_values example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">map_values</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">values</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range is an instantiation of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">second</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
- is the corresponding element in the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-</ul></div>
-<div class="section" title="map_values example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.map_values.map_values_example"></a><a class="link" href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example" title="map_values example">
- map_values example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">map</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="keyword">for</span> <span class="special">(</span><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="number">10</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
- <span class="identifier">input</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">make_pair</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">i</span> <span class="special">*</span> <span class="number">10</span><span class="special">));</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">map_values</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="map_keys.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,165 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>replaced</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="map_values.html" title="map_values">
-<link rel="next" href="replaced_if.html" title="replaced_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="map_values.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="replaced">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.replaced"></a><a class="link" href="replaced.html" title="replaced"> replaced</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example">
- replaced example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced</span><span class="special">(</span><span class="identifier">new_value</span><span class="special">,</span>
- <span class="identifier">old_value</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replace</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">new_value</span><span class="special">,</span>
- <span class="identifier">old_value</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">new_value</span></code> is convertible
- to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">old_value</span></code> is convertible
- to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, the value
- <code class="computeroutput"><span class="identifier">x</span></code> is equal to the value
- of <code class="computeroutput"><span class="special">(</span><span class="identifier">y</span>
- <span class="special">==</span> <span class="identifier">old_value</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
- <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
- is the corresponding element in the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-</ul></div>
-<div class="section" title="replaced example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.replaced.replaced_example"></a><a class="link" href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example" title="replaced example">
- replaced example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">replaced</span><span class="special">(</span><span class="number">2</span><span class="special">,</span> <span class="number">10</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="map_values.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,170 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>replaced_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="replaced.html" title="replaced">
-<link rel="next" href="reversed.html" title="reversed">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replaced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reversed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="replaced_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.replaced_if"></a><a class="link" href="replaced_if.html" title="replaced_if">
- replaced_if</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example">
- replaced_if example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span>
- <span class="identifier">new_value</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">pred</span><span class="special">,</span>
- <span class="identifier">new_value</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- The range <code class="computeroutput"><span class="identifier">value_type</span></code>
- is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">new_value</span></code> is convertible
- to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> For all elements
- <code class="computeroutput"><span class="identifier">x</span></code> in the returned range,
- the value <code class="computeroutput"><span class="identifier">x</span></code> is equal
- to the value of <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
- <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
- is the corresponding element in the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-</ul></div>
-<div class="section" title="replaced_if example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.replaced_if.replaced_if_example"></a><a class="link" href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example" title="replaced_if example">
- replaced_if example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">struct</span> <span class="identifier">is_even</span>
-<span class="special">{</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">int</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">0</span><span class="special">;</span> <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">(),</span> <span class="number">10</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replaced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reversed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/reversed.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,144 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>reversed</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="replaced_if.html" title="replaced_if">
-<link rel="next" href="sliced.html" title="sliced">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sliced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="reversed">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.reversed"></a><a class="link" href="reversed.html" title="reversed"> reversed</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example">
- reversed example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A range whose iterators behave
- as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-</ul></div>
-<div class="section" title="reversed example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.reversed.reversed_example"></a><a class="link" href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example" title="reversed example">
- reversed example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">reversed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">void</span> <span class="identifier">reversed_example_test</span><span class="special">()</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">reversed</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sliced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/sliced.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,154 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>sliced</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="reversed.html" title="reversed">
-<link rel="next" href="strided.html" title="strided">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reversed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="strided.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="sliced">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.sliced"></a><a class="link" href="sliced.html" title="sliced"> sliced</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example">
- sliced example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">sliced</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span>
- <span class="identifier">m</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">slice</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">n</span><span class="special">,</span>
- <span class="identifier">m</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
- <span class="special">&lt;=</span> <span class="identifier">n</span>
- <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
- <span class="special">&lt;=</span> <span class="identifier">m</span>
- <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
- <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span><code class="computeroutput"><span class="identifier">make_range</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-</ul></div>
-<div class="section" title="sliced example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.sliced.sliced_example"></a><a class="link" href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example" title="sliced example">
- sliced example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">sliced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">sliced</span><span class="special">(</span><span class="number">2</span><span class="special">,</span> <span class="number">5</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reversed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="strided.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/strided.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,151 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>strided</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="sliced.html" title="sliced">
-<link rel="next" href="tokenized.html" title="tokenized">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sliced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="tokenized.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="strided">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.strided"></a><a class="link" href="strided.html" title="strided"> strided</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="strided.html#range.reference.adaptors.reference.strided.strided_example">
- strided example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">strided</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">stride</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">n</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
- <span class="special">&lt;=</span> <span class="identifier">n</span>
- <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
- <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A new range based on <code class="computeroutput"><span class="identifier">rng</span></code> where traversal is performed
- in steps of <code class="computeroutput"><span class="identifier">n</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-</ul></div>
-<div class="section" title="strided example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.strided.strided_example"></a><a class="link" href="strided.html#range.reference.adaptors.reference.strided.strided_example" title="strided example">
- strided example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">strided</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">strided</span><span class="special">(</span><span class="number">2</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sliced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="tokenized.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,147 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>tokenized</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="strided.html" title="strided">
-<link rel="next" href="transformed.html" title="transformed">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="strided.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transformed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="tokenized">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized"> tokenized</a>
-</h5></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
-
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
-</pre>
-<p>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
-
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">)</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">)</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">rndRng</span><span class="special">,</span> <span class="identifier">flags</span><span class="special">)</span>
-</pre>
-<p>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- Let <code class="computeroutput"><span class="identifier">T</span></code> denote <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)&gt;::</span><span class="identifier">type</span></code>,
- then <code class="computeroutput"><span class="identifier">regex</span></code> has
- the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code> or is implicitly convertible
- to one of these types.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">i</span></code> has the type
- <code class="computeroutput"><span class="keyword">int</span></code>.
- </li>
-<li class="listitem">
- the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of <code class="computeroutput"><span class="identifier">rndRng</span></code> is <code class="computeroutput"><span class="keyword">int</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">flags</span></code> has the type
- <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A range whose iterators behave
- as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>.
- The first iterator in the range would be constructed by forwarding
- all the arguments of <code class="computeroutput"><span class="identifier">tokenized</span><span class="special">()</span></code> to the <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>
- constructor.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever constructing and
- copying equivalent <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>s
- might throw.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
-</li>
-</ul></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="strided.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transformed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/transformed.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,161 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>transformed</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="tokenized.html" title="tokenized">
-<link rel="next" href="uniqued.html" title="uniqued">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="tokenized.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uniqued.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="transformed">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.transformed"></a><a class="link" href="transformed.html" title="transformed">
- transformed</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example">
- transformed example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">transformed</span><span class="special">(</span><span class="identifier">fun</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">transform</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">fun</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range is convertible to the argument type of <code class="computeroutput"><span class="identifier">fun</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all elements <code class="computeroutput"><span class="identifier">x</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span></code>
- where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
- element in the original range.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever the copy-constructor
- of <code class="computeroutput"><span class="identifier">fun</span></code> might throw.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
- category of <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-</ul></div>
-<div class="section" title="transformed example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.transformed.transformed_example"></a><a class="link" href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example" title="transformed example">
- transformed example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">transformed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">struct</span> <span class="identifier">double_int</span>
-<span class="special">{</span>
- <span class="keyword">typedef</span> <span class="keyword">int</span> <span class="identifier">result_type</span><span class="special">;</span>
- <span class="keyword">int</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">int</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">x</span> <span class="special">*</span> <span class="number">2</span><span class="special">;</span> <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">transformed</span><span class="special">(</span><span class="identifier">double_int</span><span class="special">()),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="tokenized.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uniqued.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,147 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>uniqued</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="transformed.html" title="transformed">
-<link rel="next" href="../../algorithms.html" title="Range Algorithm">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="transformed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="uniqued">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.uniqued"></a><a class="link" href="uniqued.html" title="uniqued"> uniqued</a>
-</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example">
- uniqued example</a></span></dt></dl></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Syntax
- </p>
- </th>
-<th>
- <p>
- Code
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- Pipe
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">uniqued</span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Function
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range is comparable with <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
- <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">x</span><span class="special">==</span><span class="identifier">y</span></code> is false.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
- of the range concept of <code class="computeroutput"><span class="identifier">rng</span></code>
- and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
- </li>
-</ul></div>
-<div class="section" title="uniqued example">
-<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.uniqued.uniqued_example"></a><a class="link" href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example" title="uniqued example">
- uniqued example</a>
-</h6></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">uniqued</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">void</span> <span class="identifier">uniqued_example_test</span><span class="special">()</span>
-<span class="special">{</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
- <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
- <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">;</span>
-
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
- <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">uniqued</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<p>
- This would produce the output:
-</p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="transformed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="adaptors/reference/uniqued.html" title="uniqued">
-<link rel="next" href="algorithms/range_algorithm_introduction.html" title="Introduction and motivation">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Algorithm">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithm"> Range Algorithm</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="algorithms/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"> Mutating algorithms</span></dt>
-<dt><span class="section"><a href="algorithms/non_mutating.html"> Non-mutating
- algorithms</a></span></dt>
-<dt><span class="section"> Set algorithms</span></dt>
-<dt><span class="section"> Heap algorithms</span></dt>
-<dt><span class="section"><a href="algorithms/permutation.html"> Permutation
- algorithms</a></span></dt>
-<dt><span class="section"> New algorithms</span></dt>
-<dt><span class="section"> Numeric algorithms</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,143 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>make_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../heap.html" title="Heap algorithms">
-<link rel="prev" href="pop_heap.html" title="pop_heap">
-<link rel="next" href="sort_heap.html" title="sort_heap">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="make_heap">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.make_heap"></a><a class="link" href="make_heap.html" title="make_heap"> make_heap</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.heap.make_heap.prototype"></a><h6>
-<a name="id644655"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id645027"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">make_heap</span></code> turns <code class="computeroutput"><span class="identifier">rng</span></code> into a heap.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id645105"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.heap.make_heap.requirements"></a><h6>
-<a name="id645176"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id645408"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
- <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,155 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>pop_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../heap.html" title="Heap algorithms">
-<link rel="prev" href="push_heap.html" title="push_heap">
-<link rel="next" href="make_heap.html" title="make_heap">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="push_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="make_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="pop_heap">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.pop_heap"></a><a class="link" href="pop_heap.html" title="pop_heap"> pop_heap</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.heap.pop_heap.prototype"></a><h6>
-<a name="id643669"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id644042"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">pop_heap</span></code> removes the
- largest element from the heap. It is assumed that <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is already a heap and that the element
- to be added is <code class="computeroutput"><span class="special">*</span><span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id644197"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.heap.pop_heap.requirements"></a><h6>
-<a name="id644267"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id644498"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code></li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
-<a name="id644568"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
- </h6>
-<p>
- Logarithmic. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
- <span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="push_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="make_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,153 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>push_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../heap.html" title="Heap algorithms">
-<link rel="prev" href="../heap.html" title="Heap algorithms">
-<link rel="next" href="pop_heap.html" title="pop_heap">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="push_heap">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.push_heap"></a><a class="link" href="push_heap.html" title="push_heap"> push_heap</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.heap.push_heap.prototype"></a><h6>
-<a name="id642645"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id643017"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">push_heap</span></code> adds an element
- to a heap. It is assumed that <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is already a heap and that the element
- to be added is <code class="computeroutput"><span class="special">*</span><span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id643177"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.heap.push_heap.requirements"></a><h6>
-<a name="id643248"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id643479"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code></li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)))</span></code> is a heap.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
-<a name="id643593"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
- </h6>
-<p>
- Logarithmic. At most <code class="computeroutput"><span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,115 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="../mutating.html" title="Mutating algorithms">
-<link rel="next" href="copy_backward.html" title="copy_backward">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.copy"></a><a class="link" href="copy.html" title="copy"> copy</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.copy.prototype"></a><h6>
-<a name="id587769"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id587896"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">copy</span></code> copies all elements
- from <code class="computeroutput"><span class="identifier">source_rng</span></code> to the
- range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
- <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code>. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">+</span>
- <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.copy.definition"></a><h6>
-<a name="id588025"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.copy.requirements"></a><h6>
-<a name="id588096"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
- The <code class="computeroutput"><span class="identifier">value_type</span></code> of
- <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id588202"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
- within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
- <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id588303"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,125 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>copy_backward</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="copy.html" title="copy">
-<link rel="next" href="fill.html" title="fill">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="copy_backward">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.copy_backward"></a><a class="link" href="copy_backward.html" title="copy_backward">
- copy_backward</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.copy_backward.prototype"></a><h6>
-<a name="id588372"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BidirectionalOutputIterator</span><span class="special">&gt;</span>
- <span class="identifier">BidirectionalOutputIterator</span>
- <span class="identifier">copy_backward</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
- <span class="identifier">BidirectionalOutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id588499"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">copy_backward</span></code> copies
- all elements from <code class="computeroutput"><span class="identifier">source_rng</span></code>
- to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span>
- <span class="special">-</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>.
- </p>
-<p>
- The values are copied in reverse order. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">-</span>
- <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
- </p>
-<p>
- Note well that unlike all other standard algorithms <code class="computeroutput"><span class="identifier">out_it</span></code>
- denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
- </p>
-<a name="range.reference.algorithms.mutating.copy_backward.definition"></a><h6>
-<a name="id588654"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.copy_backward.requirements"></a><h6>
-<a name="id588724"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
- The <code class="computeroutput"><span class="identifier">value_type</span></code> of
- <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
- Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id588831"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
- within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
- <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id588932"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/fill.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,101 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>fill</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="copy_backward.html" title="copy_backward">
-<link rel="next" href="fill_n.html" title="fill_n">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="fill">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.fill"></a><a class="link" href="fill.html" title="fill"> fill</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.fill.prototype"></a><h6>
-<a name="id589000"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id589137"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">fill</span></code> assigns the value
- <code class="computeroutput"><span class="identifier">val</span></code> to every element
- in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.fill.definition"></a><h6>
-<a name="id589192"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.fill.requirements"></a><h6>
-<a name="id589262"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id589373"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,187 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>inplace_merge</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="generate.html" title="generate">
-<link rel="next" href="merge.html" title="merge">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="generate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="inplace_merge">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.inplace_merge"></a><a class="link" href="inplace_merge.html" title="inplace_merge">
- inplace_merge</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a><h6>
-<a name="id590598"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
-<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span> <span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
-<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span> <span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
-<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
-<span class="identifier">inplace_merge</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id591148"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">inplace_merge</span></code> combines
- two consecutive sorted ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
- and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> into a single sorted range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. That is, it starts with a range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> that consists o
f two pieces each of
- which is in ascending order, and rearranges it so that the entire range
- is in ascending order. <code class="computeroutput"><span class="identifier">inplace_merge</span></code>
- is stable, meaning both that the relative order of elements within each
- input range is preserved.
- </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id591366"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.requirements"></a><h6>
-<a name="id591437"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-</li>
-<li class="listitem">
- The ordering on objects of <code class="computeroutput"><span class="identifier">range_type</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate version:</strong></span> * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code> is a model of the
- <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
- Concept. * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable. * <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
- is a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id591686"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
- </h6>
-<a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id591710"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
- the non-predicate version:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">middle</span></code> is in the range
- <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code> is in ascending order. That is for
- each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
- <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is in ascending order. That is for
- each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
- <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id591962"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
- the predicate version:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">middle</span></code> is in the range
- <code class="computeroutput"><span class="identifier">rng</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code> is in ascending order. That is for
- each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
- <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is in ascending order. That is for
- each pair of adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
- <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id592234"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
- </h6>
-<p>
- Worst case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="generate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/merge.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,246 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>merge</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="inplace_merge.html" title="inplace_merge">
-<link rel="next" href="nth_element.html" title="nth_element">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nth_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="merge">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.merge"></a><a class="link" href="merge.html" title="merge"> merge</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.merge.prototype"></a><h6>
-<a name="id592315"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">merge</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">merge</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id592657"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">merge</span></code> combines two sorted
- ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> into a single sorted range by
- copying elements. <code class="computeroutput"><span class="identifier">merge</span></code>
- is stable. The return value is <code class="computeroutput"><span class="identifier">out</span>
- <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-<p>
- The two versions of <code class="computeroutput"><span class="identifier">merge</span></code>
- differ by how they compare the elements.
- </p>
-<p>
- The non-predicate version uses the <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code> for the range value type. The predicate
- version uses the predicate instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.merge.definition"></a><h6>
-<a name="id592834"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.merge.requirements"></a><h6>
-<a name="id592905"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering on objects of <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
- <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s set
- of value types.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
- <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s set
- of value types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id593398"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
- </h6>
-<a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id593422"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
- the non-predicate version:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
- are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> of <code class="computeroutput"><span class="identifier">rng1</span></code>,
- <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span> <span class="special">==</span>
- <span class="keyword">false</span></code>.
- </li>
-<li class="listitem">
- The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
- are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> of <code class="computeroutput"><span class="identifier">rng2</span></code>,
- <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span> <span class="special">==</span>
- <span class="keyword">false</span></code>.
- </li>
-<li class="listitem">
- The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
- <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- do not overlap.
- </li>
-<li class="listitem">
- The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
- <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- do not overlap.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id593869"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
- the predicate version:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
- are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, of <code class="computeroutput"><span class="identifier">rng1</span></code>,
- <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
- </li>
-<li class="listitem">
- The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
- are in ascending order. That is, for each adjacent element pair <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, of <code class="computeroutput"><span class="identifier">rng2</span></code>,
- <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
- </li>
-<li class="listitem">
- The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
- <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- do not overlap.
- </li>
-<li class="listitem">
- The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
- <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- do not overlap.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id594608"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
- </h6>
-<p>
- Linear. There are no comparisons if both <code class="computeroutput"><span class="identifier">rng1</span></code>
- and <code class="computeroutput"><span class="identifier">rng2</span></code> are empty, otherwise
- at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nth_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,151 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>nth_element</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="merge.html" title="merge">
-<link rel="next" href="partial_sort.html" title="partial_sort">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="nth_element">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.nth_element"></a><a class="link" href="nth_element.html" title="nth_element">
- nth_element</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.nth_element.prototype"></a><h6>
-<a name="id594731"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
- <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
- <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id595245"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">nth_element</span></code> partially
- orders a range of elements. <code class="computeroutput"><span class="identifier">nth_element</span></code>
- arranges the range <code class="computeroutput"><span class="identifier">rng</span></code>
- such that the element corresponding with the iterator <code class="computeroutput"><span class="identifier">nth</span></code>
- is the same as the element that would be in that position if <code class="computeroutput"><span class="identifier">rng</span></code> has been sorted.
- </p>
-<a name="range.reference.algorithms.mutating.nth_element.definition"></a><h6>
-<a name="id595324"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">nth_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.nth_element.requirements"></a><h6>
-<a name="id595394"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id595625"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
- </h6>
-<p>
- On average, linear in <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,156 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>partial_sort</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="nth_element.html" title="nth_element">
-<link rel="next" href="partition.html" title="partition">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="nth_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="partial_sort">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.partial_sort"></a><a class="link" href="partial_sort.html" title="partial_sort">
- partial_sort</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partial_sort.prototype"></a><h6>
-<a name="id595691"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
- <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
- <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id596205"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">partial_sort</span></code> rearranges
- the elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
- It places the smallest <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code> elements, sorted in ascending order,
- into the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>. The remaining elements are placed in
- an unspecified order into <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">last</span><span class="special">)</span></code>.
- </p>
-<p>
- The non-predicative versions of this function specify that one element
- is less than another by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>. The predicate versions use the
- predicate instead.
- </p>
-<a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id596384"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.partial_sort.requirements"></a><h6>
-<a name="id596454"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate version:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id596685"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
- </h6>
-<p>
- Approximately <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">))</span></code> comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="nth_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/partition.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,132 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>partition</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="partial_sort.html" title="partial_sort">
-<link rel="next" href="random_shuffle.html" title="random_shuffle">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="partition">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition"> partition</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partition.prototype"></a><h6>
-<a name="id596801"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id597367"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">partition</span></code> orders the
- elements in <code class="computeroutput"><span class="identifier">rng</span></code> based
- on <code class="computeroutput"><span class="identifier">pred</span></code>, such that the
- elements that satisfy <code class="computeroutput"><span class="identifier">pred</span></code>
- precede the elements that do not. In the versions that return a single
- iterator, the return value is the middle iterator. In the versions that
- have a configurable range_return, <code class="computeroutput"><span class="identifier">found</span></code>
- corresponds to the middle iterator.
- </p>
-<a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id597448"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.partition.requirements"></a><h6>
-<a name="id597519"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
- argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id597615"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">pred</span></code>,
- and at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
- swaps.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,132 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>random_shuffle</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="partition.html" title="partition">
-<link rel="next" href="remove.html" title="remove">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="random_shuffle">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.random_shuffle"></a><a class="link" href="random_shuffle.html" title="random_shuffle">
- random_shuffle</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a><h6>
-<a name="id597726"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span><span class="special">&amp;</span> <span class="identifier">gen</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span><span class="special">&amp;</span> <span class="identifier">gen</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id598106"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">random_shuffle</span></code> randomly
- rearranges the elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
- The versions of <code class="computeroutput"><span class="identifier">random_shuffle</span></code>
- that do not specify a <code class="computeroutput"><span class="identifier">Generator</span></code>
- use an internal random number generator. The versions of <code class="computeroutput"><span class="identifier">random_shuffle</span></code> that do specify a <code class="computeroutput"><span class="identifier">Generator</span></code> use this instead. Returns
- the shuffles range.
- </p>
-<a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id598198"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.random_shuffle.requirements"></a><h6>
-<a name="id598269"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the version without a Generator:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li></ul></div>
-<p>
- <span class="bold"><strong>For the version with a Generator:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Generator</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">RandomNumberGeneratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- distance type is convertible to <code class="computeroutput"><span class="identifier">Generator</span></code>'s
- argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id598414"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- is less than <code class="computeroutput"><span class="identifier">gen</span></code>'s
- maximum value.
- </li></ul></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
-<a name="id598475"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
- </h6>
-<p>
- Linear. If <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- swaps are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,138 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>remove</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="random_shuffle.html" title="random_shuffle">
-<link rel="next" href="remove_copy.html" title="remove_copy">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="remove">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove"></a><a class="link" href="remove.html" title="remove"> remove</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove.prototype"></a><h6>
-<a name="id598580"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id599184"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">remove</span></code> removes from
- <code class="computeroutput"><span class="identifier">rng</span></code> all of the elements
- <code class="computeroutput"><span class="identifier">x</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
- The versions of <code class="computeroutput"><span class="identifier">remove</span></code>
- that return an iterator, return an iterator <code class="computeroutput"><span class="identifier">new_last</span></code>
- such that the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">new_last</span><span class="special">)</span></code> contains no elements equal to <code class="computeroutput"><span class="identifier">val</span></code>. The <code class="computeroutput"><span class="identifier">range_return</span></code>
- versions of <code class="computeroutput"><span class="identifier">remove</span></code> defines
- <code class="computeroutput"><span class="identifier">found</span></code> as the new last
- element. The iterators in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span>
- <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
- are dereferenceable, but the elements are unspecified.
- </p>
-<a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id599413"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.remove.requirements"></a><h6>
-<a name="id599484"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
- Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
- can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
- value type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id599595"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">remove</span></code> performs
- exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- comparisons for equality.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,109 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>remove_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="remove.html" title="remove">
-<link rel="next" href="remove_copy_if.html" title="remove_copy_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="remove_copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove_copy"></a><a class="link" href="remove_copy.html" title="remove_copy">
- remove_copy</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_copy.prototype"></a><h6>
-<a name="id599672"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span>
-<span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span>
-<span class="identifier">remove_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id599969"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">remove_copy</span></code> copied all
- of the elements <code class="computeroutput"><span class="identifier">x</span></code> from
- <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.remove_copy.definition"></a><h6>
-<a name="id600056"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.remove_copy.requirements"></a><h6>
-<a name="id600125"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
- Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
- can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
- value type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id600237"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">remove_copy</span></code> performs
- exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- comparisons for equality.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>remove_copy_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="remove_copy.html" title="remove_copy">
-<link rel="next" href="remove_if.html" title="remove_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="remove_copy_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove_copy_if"></a><a class="link" href="remove_copy_if.html" title="remove_copy_if">
- remove_copy_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a><h6>
-<a name="id600315"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span>
-<span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">UnaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span>
-<span class="identifier">remove_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">UnaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id600592"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">remove_copy_if</span></code> copied
- all of the elements <code class="computeroutput"><span class="identifier">x</span></code>
- from <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">false</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a><h6>
-<a name="id600681"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a><h6>
-<a name="id600752"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPred</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
-<a name="id600838"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">remove_copy_if</span></code>
- performs exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons with UnaryPred.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,137 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>remove_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="remove_copy_if.html" title="remove_copy_if">
-<link rel="next" href="replace.html" title="replace">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="remove_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove_if"></a><a class="link" href="remove_if.html" title="remove_if"> remove_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_if.prototype"></a><h6>
-<a name="id600915"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id601479"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">remove_if</span></code> removes from
- <code class="computeroutput"><span class="identifier">rng</span></code> all of the elements
- <code class="computeroutput"><span class="identifier">x</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>. The versions of
- <code class="computeroutput"><span class="identifier">remove_if</span></code> that return
- an iterator, return an iterator <code class="computeroutput"><span class="identifier">new_last</span></code>
- such that the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">new_last</span><span class="special">)</span></code> contains no elements where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>. The iterators in
- the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> are dereferenceable, but the elements
- are unspecified.
- </p>
-<a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id601702"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.remove_if.requirements"></a><h6>
-<a name="id601774"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
- argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id601885"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">remove_if</span></code> performs
- exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- applications of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,118 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>replace</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="remove_if.html" title="remove_if">
-<link rel="next" href="replace_copy.html" title="replace_copy">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="replace">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace"></a><a class="link" href="replace.html" title="replace"> replace</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace.prototype"></a><h6>
-<a name="id601973"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">what</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">what</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id602279"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">replace</span></code> every element
- in <code class="computeroutput"><span class="identifier">rng</span></code> equal to <code class="computeroutput"><span class="identifier">what</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
- Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.replace.definition"></a><h6>
-<a name="id602356"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.replace.requirements"></a><h6>
-<a name="id602427"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
- and may be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
- value type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id602574"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">replace</span></code> performs
- exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- comparisons for equality and at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,112 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>replace_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="replace.html" title="replace">
-<link rel="next" href="replace_copy_if.html" title="replace_copy_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="replace_copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace_copy"></a><a class="link" href="replace_copy.html" title="replace_copy">
- replace_copy</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_copy.prototype"></a><h6>
-<a name="id602676"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">replace_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">what</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id602868"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">replace_copy</span></code> copy every
- element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> such that the corresponding element
- in the output range <code class="computeroutput"><span class="identifier">y</span></code>
- is <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span>
- <span class="identifier">what</span> <span class="special">?</span>
- <span class="identifier">with_what</span> <span class="special">:</span>
- <span class="identifier">x</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id602979"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.replace_copy.requirements"></a><h6>
-<a name="id603050"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
-<a name="id603185"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">replace_copy</span></code>
- performs exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,114 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>replace_copy_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="replace_copy.html" title="replace_copy">
-<link rel="next" href="replace_if.html" title="replace_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="replace_copy_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace_copy_if"></a><a class="link" href="replace_copy_if.html" title="replace_copy_if">
- replace_copy_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a><h6>
-<a name="id603264"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">replace_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id603462"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">replace_copy_if</span></code> copy
- every element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> such that the corresponding element
- in the output range <code class="computeroutput"><span class="identifier">y</span></code>
- is <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">with_what</span>
- <span class="special">:</span> <span class="identifier">x</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a><h6>
-<a name="id603575"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a><h6>
-<a name="id603648"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
-<a name="id603808"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">replace_copy_if</span></code>
- performs exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> evaluations of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,117 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>replace_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="replace_copy_if.html" title="replace_copy_if">
-<link rel="next" href="reverse.html" title="reverse">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="replace_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace_if"></a><a class="link" href="replace_if.html" title="replace_if">
- replace_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_if.prototype"></a><h6>
-<a name="id603895"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id604208"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">replace_if</span></code> replaces every
- element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">true</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
- Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.replace_if.definition"></a><h6>
-<a name="id604320"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.replace_if.requirements"></a><h6>
-<a name="id604390"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
- argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
-<a name="id604550"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">replace_if</span></code> performs
- exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- applications of <code class="computeroutput"><span class="identifier">pred</span></code>,
- and at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,96 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>reverse</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="replace_if.html" title="replace_if">
-<link rel="next" href="reverse_copy.html" title="reverse_copy">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="reverse">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.reverse"></a><a class="link" href="reverse.html" title="reverse"> reverse</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.reverse.prototype"></a><h6>
-<a name="id604661"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">reverse</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">reverse</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id604832"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">reverse</span></code> reverses a range.
- Returns a reference to the reversed range.
- </p>
-<a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id604870"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.reverse.requirements"></a><h6>
-<a name="id604941"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id605003"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">reverse</span></code> makes
- <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)/</span><span class="number">2</span></code> calls to <code class="computeroutput"><span class="identifier">iter_swap</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="replace_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,101 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>reverse_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="reverse.html" title="reverse">
-<link rel="next" href="rotate.html" title="rotate">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reverse.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="reverse_copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.reverse_copy"></a><a class="link" href="reverse_copy.html" title="reverse_copy">
- reverse_copy</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a><h6>
-<a name="id605097"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">reverse_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id605224"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">reverse_copy</span></code> copies the
- elements from <code class="computeroutput"><span class="identifier">rng</span></code> in
- reverse order to <code class="computeroutput"><span class="identifier">out</span></code>.
- Returns the output iterator one passed the last copied element.
- </p>
-<a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id605281"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a><h6>
-<a name="id605352"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
-<a name="id605439"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">reverse_copy</span></code>
- makes <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- copies.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reverse.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,109 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>rotate</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="reverse_copy.html" title="reverse_copy">
-<link rel="next" href="rotate_copy.html" title="rotate_copy">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="rotate">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.rotate"></a><a class="link" href="rotate.html" title="rotate"> rotate</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.rotate.prototype"></a><h6>
-<a name="id605516"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rotate</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rotate</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id605769"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">rotate</span></code> rotates the elements
- in a range. It exchanges the two ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
- and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.rotate.definition"></a><h6>
-<a name="id605891"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.rotate.requirements"></a><h6>
-<a name="id605962"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
-<a name="id606024"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code> is a valid range.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
-<a name="id606130"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> swaps are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,112 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>rotate_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="rotate.html" title="rotate">
-<link rel="next" href="sort.html" title="sort">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="rotate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="rotate_copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.rotate_copy"></a><a class="link" href="rotate_copy.html" title="rotate_copy">
- rotate_copy</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a><h6>
-<a name="id606197"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">rotate_copy</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id606363"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">rotate_copy</span></code> rotates the
- elements in a range. It copies the two ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
- and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> to <code class="computeroutput"><span class="identifier">out</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.rotate_copy.definition"></a><h6>
-<a name="id606484"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a><h6>
-<a name="id606555"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
-<a name="id606641"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code> is a valid range.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
-<a name="id606747"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> elements are copied.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="rotate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/sort.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,153 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>sort</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="rotate_copy.html" title="rotate_copy">
-<link rel="next" href="stable_partition.html" title="stable_partition">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="sort">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.sort"></a><a class="link" href="sort.html" title="sort"> sort</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.sort.prototype"></a><h6>
-<a name="id606813"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id607186"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">sort</span></code> sorts the elements
- in <code class="computeroutput"><span class="identifier">rng</span></code> into ascending
- order. <code class="computeroutput"><span class="identifier">sort</span></code> is not guaranteed
- to be stable. Returns the sorted range.
- </p>
-<p>
- For versions of the <code class="computeroutput"><span class="identifier">sort</span></code>
- function without a predicate, ascending order is defined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>
- such that for all adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
- <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span> <span class="special">==</span>
- <span class="keyword">false</span></code>.
- </p>
-<p>
- For versions of the <code class="computeroutput"><span class="identifier">sort</span></code>
- function with a predicate, ascending order is defined by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
- <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.sort.definition"></a><h6>
-<a name="id607432"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.sort.requirements"></a><h6>
-<a name="id607503"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For versions of sort without a predicate:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For versions of sort with a predicate</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id607734"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code> comparisons (both average and worst-case),
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,135 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>stable_partition</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="sort.html" title="sort">
-<link rel="next" href="stable_sort.html" title="stable_sort">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="stable_partition">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.stable_partition"></a><a class="link" href="stable_partition.html" title="stable_partition">
- stable_partition</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.stable_partition.prototype"></a><h6>
-<a name="id607849"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">stable_partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
-<span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
-<span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">stable_partition</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id608413"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">stable_partition</span></code> reorders
- the elements in the range <code class="computeroutput"><span class="identifier">rng</span></code>
- base on the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
- Once this function has completed all of the elements that satisfy <code class="computeroutput"><span class="identifier">pred</span></code> appear before all of the elements
- that fail to satisfy it. <code class="computeroutput"><span class="identifier">stable_partition</span></code>
- differs from <code class="computeroutput"><span class="identifier">partition</span></code>
- because it preserves relative order. It is stable.
- </p>
-<p>
- For the versions that return an iterator, the return value is the iterator
- to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<p>
- For versions that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- the <code class="computeroutput"><span class="identifier">found</span></code> iterator is
- the iterator to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.stable_partition.definition"></a><h6>
-<a name="id608558"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.stable_partition.requirements"></a><h6>
-<a name="id608632"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
-<a name="id608717"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
- </h6>
-<p>
- Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- Worst case: <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
- <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
- swaps, where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,157 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>stable_sort</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="stable_partition.html" title="stable_partition">
-<link rel="next" href="swap_ranges.html" title="swap_ranges">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="stable_sort">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.stable_sort"></a><a class="link" href="stable_sort.html" title="stable_sort">
- stable_sort</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.stable_sort.prototype"></a><h6>
-<a name="id608885"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id609257"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">stable_sort</span></code> sorts the
- elements in <code class="computeroutput"><span class="identifier">rng</span></code> into
- ascending order. <code class="computeroutput"><span class="identifier">stable_sort</span></code>
- is guaranteed to be stable. The order is preserved for equivalent elements.
- </p>
-<p>
- For versions of the <code class="computeroutput"><span class="identifier">stable_sort</span></code>
- function without a predicate ascending order is defined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>
- such that for all adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>,
- <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span> <span class="special">==</span>
- <span class="keyword">false</span></code>.
- </p>
-<p>
- For versions of the <code class="computeroutput"><span class="identifier">stable_sort</span></code>
- function with a predicate, ascending order is designed by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
- <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.stable_sort.definition"></a><h6>
-<a name="id609501"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.stable_sort.requirements"></a><h6>
-<a name="id609572"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For versions of stable_sort without a predicate</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For versions of stable_sort with a predicate:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id609802"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
- </h6>
-<p>
- Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- Worst case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)^</span><span class="number">2</span><span class="special">)</span></code>
- comparisons, where <code class="computeroutput"><span class="identifier">N</span></code>
- is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>swap_ranges</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="stable_sort.html" title="stable_sort">
-<link rel="next" href="transform.html" title="transform">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transform.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="swap_ranges">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.swap_ranges"></a><a class="link" href="swap_ranges.html" title="swap_ranges">
- swap_ranges</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a><h6>
-<a name="id609983"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">swap_ranges</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id610114"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">swap_ranges</span></code> swaps each
- element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng1</span></code> with the corresponding element
- <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng2</span></code>.
- Returns a reference to <code class="computeroutput"><span class="identifier">rng2</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.swap_ranges.definition"></a><h6>
-<a name="id610203"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">swap_ranges</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a><h6>
-<a name="id610274"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- mutable.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id610374"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> elements are swapped.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transform.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/transform.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,225 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>transform</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="swap_ranges.html" title="swap_ranges">
-<link rel="next" href="unique.html" title="unique">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="transform">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.transform"></a><a class="link" href="transform.html" title="transform"> transform</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.transform.prototype"></a><h6>
-<a name="id610442"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryOperation</span>
-<span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">transform</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">UnaryOperation</span> <span class="identifier">fun</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryOperation</span>
-<span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">transform</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryOperation</span> <span class="identifier">fun</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id610772"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
- </h6>
-<p>
- <span class="bold"><strong>UnaryOperation version:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">transform</span></code> assigns the
- value <code class="computeroutput"><span class="identifier">y</span></code> to each element
- <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)),</span> <span class="identifier">y</span> <span class="special">=</span> <span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">x</span></code>
- is the corresponding value to <code class="computeroutput"><span class="identifier">y</span></code>
- in <code class="computeroutput"><span class="identifier">rng1</span></code>. The return value
- is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span>
- <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-<p>
- <span class="bold"><strong>BinaryOperation version:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">transform</span></code> assigns the
- value <code class="computeroutput"><span class="identifier">z</span></code> to each element
- <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))),</span> <span class="identifier">z</span> <span class="special">=</span> <span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">x</span></code>
- is the corresponding value in <code class="computeroutput"><span class="identifier">rng1</span></code>
- and <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
- value in <code class="computeroutput"><span class="identifier">rng2</span></code>. This version
- of <code class="computeroutput"><span class="identifier">transform</span></code> stops upon
- reaching either the end of <code class="computeroutput"><span class="identifier">rng1</span></code>,
- or the end of <code class="computeroutput"><span class="identifier">rng2</span></code>. Hence
- there isn't a requirement for <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>
- since there is a safe guaranteed behaviour, unlike with the iterator
- counterpart in the standard library.
- </p>
-<p>
- The return value is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
- </p>
-<a name="range.reference.algorithms.mutating.transform.definition"></a><h6>
-<a name="id611306"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transform</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.transform.requirements"></a><h6>
-<a name="id611377"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the unary versions of transform:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryOperation</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type must be convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
- argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s result
- type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the binary versions of transform:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
- second argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s result
- type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id611991"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the unary version of transform:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
- within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code> is a valid range.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the binary version of transform:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
- within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
- within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)))</span></code> is a valid range.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
-<a name="id612395"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
- </h6>
-<p>
- Linear. The operation is applied exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> for the unary version and <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- for the binary version.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,163 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>unique</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="transform.html" title="transform">
-<link rel="next" href="unique_copy.html" title="unique_copy">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="transform.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="unique">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.unique"></a><a class="link" href="unique.html" title="unique"> unique</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.unique.prototype"></a><h6>
-<a name="id612512"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">unique</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id613514"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">unique</span></code> removes all but
- the first element of each sequence of duplicate encountered in <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<p>
- Elements in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span>
- <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
- are dereferenceable but undefined.
- </p>
-<p>
- Equality is determined by the predicate if one is supplied, or by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>
- for <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type.
- </p>
-<a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id613634"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.unique.requirements"></a><h6>
-<a name="id613704"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions of unique:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id613909"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- comparisons are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="transform.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,143 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>unique_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../mutating.html" title="Mutating algorithms">
-<link rel="prev" href="unique.html" title="unique">
-<link rel="next" href="../non_mutating.html" title="Non-mutating algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="unique.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="unique_copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.unique_copy"></a><a class="link" href="unique_copy.html" title="unique_copy">
- unique_copy</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.unique_copy.prototype"></a><h6>
-<a name="id614033"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id614285"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">unique_copy</span></code> copies the
- first element of each sequence of duplicates encountered in <code class="computeroutput"><span class="identifier">rng</span></code> to <code class="computeroutput"><span class="identifier">out</span></code>.
- </p>
-<p>
- Equality is determined by the predicate if one is supplied, or by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>
- for <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
- value type.
- </p>
-<a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id614373"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.mutating.unique_copy.requirements"></a><h6>
-<a name="id614444"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions of unique:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
-<a name="id614701"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- comparisons are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="unique.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/copy_n.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,103 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>copy_n</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="../new.html" title="New algorithms">
-<link rel="next" href="erase.html" title="erase">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../new.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="copy_n">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n"> copy_n</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.copy_n.prototype"></a><h6>
-<a name="id648347"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id648503"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">copy_n</span></code> is provided to
- completely replicate the standard algorithm header, it is preferable
- to use Range Adaptors and the extension functions to achieve the same
- result with greater safety.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">copy_n</span></code> copies elements
- from <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code> to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>
- </p>
-<a name="range.reference.algorithms.new.copy_n.definition"></a><h6>
-<a name="id648673"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.copy_n.requirements"></a><h6>
-<a name="id648744"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Size</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
-<a name="id648846"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> elements
- are copied.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../new.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/erase.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,96 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>erase</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="copy_n.html" title="copy_n">
-<link rel="next" href="for_each.html" title="for_each">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copy_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="erase">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase"> erase</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.erase.prototype"></a><h6>
-<a name="id648901"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">erase</span><span class="special">(</span>
- <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">to_erase</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id649040"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">erase</span></code> the iterator range
- <code class="computeroutput"><span class="identifier">to_erase</span></code> from the container
- <code class="computeroutput"><span class="identifier">target</span></code>.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">remove_erase</span></code> performs
- the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">value</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> performs
- the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">pred</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
- </p>
-<a name="range.reference.algorithms.new.erase.definition"></a><h6>
-<a name="id649337"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.erase.requirements"></a><h6>
-<a name="id649407"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
- erase of an iterator range.
- </li></ol></div>
-<a name="range.reference.algorithms.new.erase.complexity"></a><h6>
-<a name="id649452"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Proprotional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">to_erase</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="copy_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/for_each.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,149 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>for_each</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="erase.html" title="erase">
-<link rel="next" href="insert.html" title="insert">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="for_each">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each"> for_each</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.for_each.prototype"></a><h6>
-<a name="id649517"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
- <span class="special">&gt;</span>
-<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
- <span class="special">&gt;</span>
-<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
- <span class="special">&gt;</span>
-<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryFunction</span>
- <span class="special">&gt;</span>
-<span class="identifier">BinaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryFunction</span> <span class="identifier">fn</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id650085"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
- through <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> simultaneously. For each iteration,
- the element <code class="computeroutput"><span class="identifier">x</span></code> is used
- from <code class="computeroutput"><span class="identifier">rng1</span></code> and the corresponding
- element <code class="computeroutput"><span class="identifier">y</span></code> is used from
- <code class="computeroutput"><span class="identifier">rng2</span></code> to invoke <code class="computeroutput"><span class="identifier">fn</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>.
- </p>
-<p>
- Iteration is stopped upon reaching the end of the shorter of <code class="computeroutput"><span class="identifier">rng1</span></code>, or <code class="computeroutput"><span class="identifier">rng2</span></code>.
- It is safe to call this function with unequal length ranges.
- </p>
-<a name="range.reference.algorithms.new.for_each.definition"></a><h6>
-<a name="id650243"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.for_each.requirements"></a><h6>
-<a name="id650315"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryFunction</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglepassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
- second argument type.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id650466"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- applications of <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/insert.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,105 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>insert</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="for_each.html" title="for_each">
-<link rel="next" href="iota.html" title="iota">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="insert">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert"> insert</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.insert.prototype"></a><h6>
-<a name="id650572"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
- <span class="special">&gt;</span>
-<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">before</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id650738"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">insert</span></code> all of the elements
- in the range <code class="computeroutput"><span class="identifier">from</span></code> before
- the <code class="computeroutput"><span class="identifier">before</span></code> iterator into
- <code class="computeroutput"><span class="identifier">target</span></code>.
- </p>
-<a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id650807"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.insert.requirements"></a><h6>
-<a name="id650878"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
- insert at a specified position.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
- value type.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id650969"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
- assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/iota.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,95 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>iota</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="insert.html" title="insert">
-<link rel="next" href="is_sorted.html" title="is_sorted">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="iota">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota"> iota</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.iota.prototype"></a><h6>
-<a name="id651038"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id651162"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">iota</span></code> traverses forward
- through <code class="computeroutput"><span class="identifier">rng</span></code>, each element
- <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code>
- is assigned a value equivalent to <code class="computeroutput"><span class="identifier">x</span>
- <span class="special">+</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">it</span><span class="special">)</span></code>
- </p>
-<a name="range.reference.algorithms.new.iota.definition"></a><h6>
-<a name="id651298"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.iota.requirements"></a><h6>
-<a name="id651367"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">Incrementable</span></code> Concept.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id651443"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments into <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,108 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>is_sorted</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="iota.html" title="iota">
-<link rel="next" href="overwrite.html" title="overwrite">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="is_sorted">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted"> is_sorted</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.is_sorted.prototype"></a><h6>
-<a name="id651519"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id651710"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">is_sorted</span></code> determines
- if a range is sorted. For the non-predicate version the return value
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if for
- each adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
- the expression <code class="computeroutput"><span class="identifier">x</span> <span class="special">&lt;</span>
- <span class="identifier">y</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
- For the predicate version the return value is <code class="computeroutput"><span class="keyword">true</span></code>
- is and only if for each adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
- the expression <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>.
- </p>
-<a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id651900"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.is_sorted.requirements"></a><h6>
-<a name="id651972"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
- Concept.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to both argument types of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
-<a name="id652075"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
- </h6>
-<p>
- Linear. A maximum of <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/overwrite.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,110 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>overwrite</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="is_sorted.html" title="is_sorted">
-<link rel="next" href="push_back.html" title="push_back">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="overwrite">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite"> overwrite</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.overwrite.prototype"></a><h6>
-<a name="id652142"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span>
- <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">overwrite</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">,</span>
- <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">to</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id652276"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">overwrite</span></code> assigns the
- values from the range <code class="computeroutput"><span class="identifier">from</span></code>
- into the range <code class="computeroutput"><span class="identifier">to</span></code>.
- </p>
-<a name="range.reference.algorithms.new.overwrite.definition"></a><h6>
-<a name="id652334"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.overwrite.requirements"></a><h6>
-<a name="id652405"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- mutable.
- </li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">)</span>
- <span class="special">&lt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange2</span><span class="special">)</span></code></li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id652572"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
- assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_back.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,103 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>push_back</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="overwrite.html" title="overwrite">
-<link rel="next" href="push_front.html" title="push_front">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overwrite.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="push_back">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back"> push_back</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.push_back.prototype"></a><h6>
-<a name="id652640"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
- <span class="special">&gt;</span>
-<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id652778"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">push_back</span></code> all of the
- elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
- to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
- </p>
-<a name="range.reference.algorithms.new.push_back.definition"></a><h6>
-<a name="id652836"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.push_back.requirements"></a><h6>
-<a name="id652906"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
- insert at <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
- value type.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id653013"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
- assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overwrite.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/push_front.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,103 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>push_front</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="push_back.html" title="push_back">
-<link rel="next" href="remove_erase.html" title="remove_erase">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="push_back.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="push_front">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front"> push_front</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.push_front.prototype"></a><h6>
-<a name="id653081"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
- <span class="special">&gt;</span>
-<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">push_front</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id653218"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">push_front</span></code> all of the
- elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
- to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
- </p>
-<a name="range.reference.algorithms.new.push_front.definition"></a><h6>
-<a name="id653275"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.push_front.requirements"></a><h6>
-<a name="id653346"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
- insert at <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
- value type.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id653453"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
- assignments are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="push_back.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,88 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>remove_erase</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="push_front.html" title="push_front">
-<link rel="next" href="remove_erase_if.html" title="remove_erase_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="push_front.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="remove_erase">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase"> remove_erase</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.remove_erase.prototype"></a><h6>
-<a name="id653521"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id653657"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
- eliminates the elements equal to <code class="computeroutput"><span class="identifier">value</span></code>
- from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">remove</span></code>
- algorithm which merely rearranges elements.
- </p>
-<a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id653717"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.remove_erase.requirements"></a><h6>
-<a name="id653788"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
- erase of an iterator range.
- </li></ol></div>
-<a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
-<a name="id653831"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="push_front.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,96 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>remove_erase_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../new.html" title="New algorithms">
-<link rel="prev" href="remove_erase.html" title="remove_erase">
-<link rel="next" href="../numeric.html" title="Numeric algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="remove_erase_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">
- remove_erase_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
-<a name="id653900"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">&gt;</span>
-<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="identifier">Pred</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id654025"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> removes
- the elements <code class="computeroutput"><span class="identifier">x</span></code> that satisfy
- <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">erase</span></code>
- algorithm which merely rearranges elements.
- </p>
-<a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id654107"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.new.remove_erase_if.requirements"></a><h6>
-<a name="id654178"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
- erase of an iterator range.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Pred</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">Predicate</span></code> Concept.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
-<a name="id654248"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,168 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>adjacent_find</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="next" href="binary_search.html" title="binary_search">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="binary_search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="adjacent_find">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">
- adjacent_find</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
-<a name="id614844"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPred</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value_re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="identifier">range_return_value_re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id615801"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
- </h6>
-<p>
- <span class="bold"><strong>Non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">adjacent_find</span></code> finds the
- first adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
- in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">y</span></code>
- </p>
-<p>
- <span class="bold"><strong>Predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">adjacent_find</span></code> finds the
- first adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>
- in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a><h6>
-<a name="id616008"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a><h6>
-<a name="id616080"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions of adjacent_find:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions of adjacent_find:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id616258"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
- </h6>
-<p>
- Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- then no comparisons are performed; otherwise, at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="binary_search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,157 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>binary_search</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="adjacent_find.html" title="adjacent_find">
-<link rel="next" href="count.html" title="count">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adjacent_find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="binary_search">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">
- binary_search</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
-<a name="id616361"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id616634"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">binary_search</span></code> returns
- <code class="computeroutput"><span class="keyword">true</span></code> if and only if the
- value <code class="computeroutput"><span class="identifier">val</span></code> exists in the
- range <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.definition"></a><h6>
-<a name="id616704"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a><h6>
-<a name="id616776"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions of binary_search:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
- is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions of binary_search:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id617026"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate version:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
- order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate version:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
- order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a><h6>
-<a name="id617120"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
- </h6>
-<p>
- For non-random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">N</span></code>
- is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-<p>
- For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adjacent_find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,107 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>count</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="binary_search.html" title="binary_search">
-<link rel="next" href="count_if.html" title="count_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binary_search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="count">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count"> count</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.count.prototype"></a><h6>
-<a name="id617285"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">count</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id617574"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">count</span></code> returns the number
- of elements <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">x</span>
- <span class="special">==</span> <span class="identifier">val</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id617662"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.count.requirements"></a><h6>
-<a name="id617733"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
- An object of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
- value type can be compared for equality with an object of type <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
-<a name="id617856"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binary_search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>count_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="count.html" title="count">
-<link rel="next" href="equal.html" title="equal">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="count.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="count_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">
- count_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
-<a name="id617925"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">count_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id618080"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">count_if</span></code> returns the
- number of elements <code class="computeroutput"><span class="identifier">x</span></code>
- in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.count_if.definition"></a><h6>
-<a name="id618171"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.count_if.requirements"></a><h6>
-<a name="id618242"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
-<a name="id618365"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="count.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,162 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>equal</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="count_if.html" title="count_if">
-<link rel="next" href="equal_range.html" title="equal_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="count_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="equal">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal"> equal</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.equal.prototype"></a><h6>
-<a name="id618442"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span>
-<span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
-<span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id618721"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">equal</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is equal to the <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> and for each element <code class="computeroutput"><span class="identifier">x</span></code>
- in <code class="computeroutput"><span class="identifier">rng1</span></code>, the corresponding
- element <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng2</span></code> is equal. Otherwise <code class="computeroutput"><span class="keyword">false</span></code> is returned.
- </p>
-<p>
- In this range version of <code class="computeroutput"><span class="identifier">equal</span></code>
- it is perfectly acceptable to pass in two ranges of unequal lengths.
- </p>
-<p>
- Elements are considered equal in the non-predicate version if <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
- returns <code class="computeroutput"><span class="keyword">true</span></code>. Elements are
- considered equal in the predicate version if <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.equal.definition"></a><h6>
-<a name="id618957"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.equal.requirements"></a><h6>
-<a name="id619028"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id619318"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="count_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,179 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>equal_range</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="equal.html" title="equal">
-<link rel="next" href="for_each.html" title="for_each">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="equal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="equal_range">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">
- equal_range</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
-<a name="id619413"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
- </pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id620265"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">equal_range</span></code> returns a
- range in the form of a pair of iterators where all of the elements are
- equal to <code class="computeroutput"><span class="identifier">val</span></code>. If no values
- are found that are equal to <code class="computeroutput"><span class="identifier">val</span></code>,
- then an empty range is returned, hence <code class="computeroutput"><span class="identifier">result</span><span class="special">.</span><span class="identifier">first</span> <span class="special">==</span> <span class="identifier">result</span><span class="special">.</span><span class="identifier">second</span></code>.
- For the non-predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code>
- the equality of elements is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>. For the predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code> the equality of elements
- is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.definition"></a><h6>
-<a name="id620412"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a><h6>
-<a name="id620485"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
- is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SortPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to both of <code class="computeroutput"><span class="identifier">SortPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id620733"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
- </h6>
-<p>
- For the non-predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
- is ordered in ascending order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- For the predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
- is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a><h6>
-<a name="id620809"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
- </h6>
-<p>
- For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
- otherwise the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="equal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,110 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>find</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="for_each.html" title="for_each">
-<link rel="next" href="find_end.html" title="find_end">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_end.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="find">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find"> find</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find.prototype"></a><h6>
-<a name="id621468"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id621753"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">find</span></code>
- that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span> <span class="special">==</span> <span class="identifier">value</span></code>. <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> is returned if no such iterator exists.
- The versions of find that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id621872"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.find.requirements"></a><h6>
-<a name="id621942"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
- is defined for type <code class="computeroutput"><span class="identifier">Value</span></code>
- to be compared with the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
- value type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id622056"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons for equality.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_end.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,174 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>find_end</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="find.html" title="find">
-<link rel="next" href="find_first_of.html" title="find_first_of">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="find_end">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">
- find_end</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
-<a name="id622124"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id622769"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
- that return an iterator, return an iterator to the beginning of the last
- sub-sequence equal to <code class="computeroutput"><span class="identifier">rng2</span></code>
- within <code class="computeroutput"><span class="identifier">rng1</span></code>. Equality
- is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">find_end</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions. The
- versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id622898"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.find_end.requirements"></a><h6>
-<a name="id622970"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
- Objects of <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s
- value type can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value type.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id623256"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
- </h6>
-<p>
- The number of comparisons is proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. If both <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>
- and <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> are
- models of <code class="computeroutput"><span class="identifier">BidirectionalRangeConcept</span></code>
- then the average complexity is linear and the worst case is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,170 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>find_first_of</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="find_end.html" title="find_end">
-<link rel="next" href="find_if.html" title="find_if">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find_end.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="find_first_of">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">
- find_first_of</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
-<a name="id623429"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id624079"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
- that return an iterator, return an iterator to the first occurrence in
- <code class="computeroutput"><span class="identifier">rng1</span></code> of any of the elements
- in <code class="computeroutput"><span class="identifier">rng2</span></code>. Equality is
- determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
- for non-predicate versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>,
- and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code>
- in the predicate versions.
- </p>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id624214"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a><h6>
-<a name="id624287"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
- and can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
- value type.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id624537"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
- </h6>
-<p>
- At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find_end.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,121 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>find_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="find_first_of.html" title="find_first_of">
-<link rel="next" href="lexicographical_compare.html" title="lexicographical_compare">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="find_if">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">
- find_if</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
-<a name="id624629"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id624914"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
- that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that <code class="computeroutput"><span class="identifier">pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
- <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- is returned if no such iterator exists.
- </p>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines found in the same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.find_if.definition"></a><h6>
-<a name="id625046"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.find_if.requirements"></a><h6>
-<a name="id625117"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
-<a name="id625216"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
- </h6>
-<p>
- For each iterator <code class="computeroutput"><span class="identifier">i</span></code> in
- <code class="computeroutput"><span class="identifier">rng</span></code>, <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span></code> is in the domain of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.find_if.complexity"></a><h6>
-<a name="id625287"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,113 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>for_each</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="equal_range.html" title="equal_range">
-<link rel="next" href="find.html" title="find">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="equal_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="for_each">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.for_each"></a><a class="link" href="for_each.html" title="for_each">
- for_each</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.for_each.prototype"></a><h6>
-<a name="id620907"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
- <span class="special">&gt;</span>
-<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
- <span class="special">&gt;</span>
-<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id621128"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
- through <code class="computeroutput"><span class="identifier">rng</span></code> and for each
- element <code class="computeroutput"><span class="identifier">x</span></code> it invokes
- <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.for_each.definition"></a><h6>
-<a name="id621208"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.for_each.requirements"></a><h6>
-<a name="id621278"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
- </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryFunction</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryFunction</span></code> does
- not apply any non-constant operation through its argument.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
- argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id621391"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="equal_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,170 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>lexicographical_compare</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="find_if.html" title="find_if">
-<link rel="next" href="lower_bound.html" title="lower_bound">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="lexicographical_compare">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">
- lexicographical_compare</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
-<a name="id625368"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span>
- <span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id625649"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
- compares element by element <code class="computeroutput"><span class="identifier">rng1</span></code>
- against <code class="computeroutput"><span class="identifier">rng2</span></code>. If the
- element from <code class="computeroutput"><span class="identifier">rng1</span></code> is
- less than the element from <code class="computeroutput"><span class="identifier">rng2</span></code>
- then <code class="computeroutput"><span class="keyword">true</span></code> is returned. If
- the end of <code class="computeroutput"><span class="identifier">rng1</span></code> without
- reaching the end of <code class="computeroutput"><span class="identifier">rng2</span></code>
- this also causes the return value to be <code class="computeroutput"><span class="keyword">true</span></code>.
- The return value is <code class="computeroutput"><span class="keyword">false</span></code>
- in all other circumstances. The elements are compared using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>
- in the non-predicate versions of <code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
- and using <code class="computeroutput"><span class="identifier">pred</span></code> in the
- predicate versions.
- </p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id625822"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a><h6>
-<a name="id625894"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions of lexicographical_compare:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- Let <code class="computeroutput"><span class="identifier">x</span></code> be an object
- of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type. Let <code class="computeroutput"><span class="identifier">y</span></code> be
- an obect of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type. <code class="computeroutput"><span class="identifier">x</span> <span class="special">&lt;</span>
- <span class="identifier">y</span></code> must be valid. <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
- <span class="identifier">x</span></code> must be valid.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions of lexicographical_compare:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id626250"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
- <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="find_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,176 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>lower_bound</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="lexicographical_compare.html" title="lexicographical_compare">
-<link rel="next" href="max_element.html" title="max_element">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="max_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="lower_bound">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">
- lower_bound</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
-<a name="id626355"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id626640"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
- that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that: without predicate -
- <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span>
- <span class="special">&lt;</span> <span class="identifier">value</span></code>
- is <code class="computeroutput"><span class="keyword">false</span></code>, with predicate
- - <code class="computeroutput"><span class="identifier">pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">value</span><span class="special">)</span></code>
- is <code class="computeroutput"><span class="keyword">false</span></code>.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- is returned if no such iterator exists.
- </p>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id626831"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a><h6>
-<a name="id626904"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
- is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id627153"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
- order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
- order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a><h6>
-<a name="id627246"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
- </h6>
-<p>
- For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> concept the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-<p>
- For all other range types the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="max_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,166 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>max_element</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="lower_bound.html" title="lower_bound">
-<link rel="next" href="min_element.html" title="min_element">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="min_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="max_element">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">
- max_element</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
-<a name="id627390"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value_re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">max_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id628354"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
- that return an iterator, return the iterator to the maximum value as
- determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> if a predicate is not supplied. Otherwise
- the predicate <code class="computeroutput"><span class="identifier">pred</span></code> is
- used to determine the maximum value. The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id628453"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.max_element.requirements"></a><h6>
-<a name="id628525"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id628690"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="min_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,166 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>min_element</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="max_element.html" title="max_element">
-<link rel="next" href="mismatch.html" title="mismatch">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="max_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mismatch.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="min_element">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">
- min_element</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
-<a name="id628792"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value_re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">min_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id630027"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
- that return an iterator, return the iterator to the minimum value as
- determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> if a predicate is not supplied. Otherwise
- the predicate <code class="computeroutput"><span class="identifier">pred</span></code> is
- used to determine the minimum value. The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id630125"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.min_element.requirements"></a><h6>
-<a name="id630198"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id630364"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="max_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mismatch.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,216 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>mismatch</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="min_element.html" title="min_element">
-<link rel="next" href="search.html" title="search">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="min_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="mismatch">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">
- mismatch</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
-<a name="id630466"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id632143"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
- position where the correseponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
- are not equal.
- </p>
-<p>
- Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
- </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
-<a name="id632241"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a><h6>
-<a name="id632312"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>s value
- type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id632603"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a><h6>
-<a name="id632676"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> comparisons.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="min_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,206 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>search</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="mismatch.html" title="mismatch">
-<link rel="next" href="search_n.html" title="search_n">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mismatch.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="search">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">
- search</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
-<a name="id632744"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
-<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
-<span class="identifier">search</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id634051"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">search</span></code>
- that return an iterator, return an iterator to the start of the first
- subsequence in <code class="computeroutput"><span class="identifier">rng1</span></code> that
- is equal to the subsequence <code class="computeroutput"><span class="identifier">rng2</span></code>.
- The <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
- is returned if no such subsequence exists in <code class="computeroutput"><span class="identifier">rng1</span></code>.
- Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">search</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
- </p>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">search</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id634218"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.search.requirements"></a><h6>
-<a name="id634289"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>s value
- type can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
- value type.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
- model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id634574"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
- </h6>
-<p>
- Average complexity is Linear. Worst-case complexity is quadratic.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mismatch.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,148 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>search_n</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="search.html" title="search">
-<link rel="next" href="upper_bound.html" title="upper_bound">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upper_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="search_n">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">
- search_n</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
-<a name="id634619"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search_n</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search_n</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">binary_pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">search_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">binary_pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id635352"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">search_n</span></code> searches <code class="computeroutput"><span class="identifier">rng</span></code> for a sequence of length <code class="computeroutput"><span class="identifier">n</span></code> equal to <code class="computeroutput"><span class="identifier">value</span></code>
- where equality is determined by operator== in the non-predicate case,
- and by a predicate when one is supplied.
- </p>
-<a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id635420"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.search_n.requirements"></a><h6>
-<a name="id635492"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>s value
- type can be compared for equality with <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
-<a name="id635757"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
- </h6>
-<p>
- Average complexity is Linear. Worst-case complexity is quadratic.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upper_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,173 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>upper_bound</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
-<link rel="prev" href="search_n.html" title="search_n">
-<link rel="next" href="../set.html" title="Set algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="search_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../set.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="upper_bound">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">
- upper_bound</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
-<a name="id635803"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id636087"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
- </h6>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
- that return an iterator, returns the first iterator in the range <code class="computeroutput"><span class="identifier">rng</span></code> such that: without predicate -
- <code class="computeroutput"><span class="identifier">val</span> <span class="special">&lt;</span>
- <span class="special">*</span><span class="identifier">i</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code>, with predicate
- - <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">val</span><span class="special">,</span> <span class="special">*</span><span class="identifier">i</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- is returned if no such iterator exists.
- </p>
-<p>
- The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
- that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
- defines <code class="computeroutput"><span class="identifier">found</span></code> in the
- same manner as the returned iterator described above.
- </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id636283"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a><h6>
-<a name="id636356"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
- is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
- of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
- Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
- type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id636606"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
- order according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
- order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a><h6>
-<a name="id636698"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
- </h6>
-<p>
- For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- For all other range types the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="search_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../set.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,156 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>accumulate</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../numeric.html" title="Numeric algorithms">
-<link rel="prev" href="../numeric.html" title="Numeric algorithms">
-<link rel="next" href="adjacent_difference.html" title="adjacent_difference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../numeric.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="accumulate">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.accumulate"></a><a class="link" href="accumulate.html" title="accumulate"> accumulate</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.accumulate.prototype"></a><h6>
-<a name="id654333"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span>
- <span class="special">&gt;</span>
-<span class="identifier">Value</span> <span class="identifier">accumulate</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
- <span class="identifier">Value</span> <span class="identifier">init</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryOperation</span>
- <span class="special">&gt;</span>
-<span class="identifier">Value</span> <span class="identifier">accumulate</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
- <span class="identifier">Value</span> <span class="identifier">init</span><span class="special">,</span>
- <span class="identifier">BinaryOperation</span> <span class="identifier">op</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id654592"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">accumulate</span></code> is a generalisation
- of summation. It computes a binary operation (<code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code> in the non-predicate version) of <code class="computeroutput"><span class="identifier">init</span></code> and all of the elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<p>
- The return value is the resultant value of the above algorithm.
- </p>
-<a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id654669"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.numeric.accumulate.requirements"></a><h6>
-<a name="id654732"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id654756"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
- the first version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
- An <code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code>
- is defined for a left-hand operand of type <code class="computeroutput"><span class="identifier">Value</span></code>
- and a right-hand operance of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- value type.
- </li>
-<li class="listitem">
- The return type of the above operator is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id654891"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
- the second version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
- type is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
- second argument type.
- </li>
-<li class="listitem">
- The return type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
- is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
-<a name="id655069"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../numeric.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,179 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>adjacent_difference</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../numeric.html" title="Numeric algorithms">
-<link rel="prev" href="accumulate.html" title="accumulate">
-<link rel="next" href="inner_product.html" title="inner_product">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="accumulate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inner_product.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="adjacent_difference">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.adjacent_difference"></a><a class="link" href="adjacent_difference.html" title="adjacent_difference">
- adjacent_difference</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a><h6>
-<a name="id655140"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">adjacent_difference</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryOperation</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">adjacent_difference</span><span class="special">(</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">,</span>
- <span class="identifier">BinaryOperation</span> <span class="identifier">op</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id655401"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">adjacent_difference</span></code> calculates
- the differences of adjacent_elements in <code class="computeroutput"><span class="identifier">rng</span></code>.
- </p>
-<p>
- The first version of <code class="computeroutput"><span class="identifier">adjacent_difference</span></code>
- uses <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>
- to calculate the differences. The second version uses <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
- instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
- </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a><h6>
-<a name="id655506"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.requirements"></a><h6>
-<a name="id655569"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id655593"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
- the first version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
- If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
- value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
- is defined.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-<li class="listitem">
- The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
- is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id655790"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
- the second version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
- first and second argument types.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-<li class="listitem">
- The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
- is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id655972"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
- <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
- </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.complexity"></a><h6>
-<a name="id656046"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
- </h6>
-<p>
- Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- then zero applications, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- applications are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="accumulate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inner_product.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,192 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>inner_product</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../numeric.html" title="Numeric algorithms">
-<link rel="prev" href="adjacent_difference.html" title="adjacent_difference">
-<link rel="next" href="partial_sum.html" title="partial_sum">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sum.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="inner_product">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.inner_product"></a><a class="link" href="inner_product.html" title="inner_product">
- inner_product</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.inner_product.prototype"></a><h6>
-<a name="id656149"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
- <span class="identifier">Value</span> <span class="identifier">inner_product</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">Value</span> <span class="identifier">init</span> <span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryOperation1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryOperation2</span><span class="special">&gt;</span>
- <span class="identifier">Value</span> <span class="identifier">inner_product</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">Value</span> <span class="identifier">init</span><span class="special">,</span>
- <span class="identifier">BinaryOperation1</span> <span class="identifier">op1</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id656509"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">inner_product</span></code> calculates
- a generalised inner product of the range <code class="computeroutput"><span class="identifier">rng1</span></code>
- and <code class="computeroutput"><span class="identifier">rng2</span></code>.
- </p>
-<p>
- For further information on the <code class="computeroutput"><span class="identifier">inner_product</span></code>
- algorithm please see inner_product.
- </p>
-<a name="range.reference.algorithms.numeric.inner_product.definition"></a><h6>
-<a name="id656588"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.numeric.inner_product.requirements"></a><h6>
-<a name="id656650"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id656674"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
- the first version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
- If <code class="computeroutput"><span class="identifier">x</span></code> is an object of
- type <code class="computeroutput"><span class="identifier">Value</span></code>, <code class="computeroutput"><span class="identifier">y</span></code> is an object of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type, and <code class="computeroutput"><span class="identifier">z</span></code> is
- an object of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span> <span class="special">*</span> <span class="identifier">z</span></code>
- is defined.
- </li>
-<li class="listitem">
- The result type of the expression <code class="computeroutput"><span class="identifier">x</span>
- <span class="special">+</span> <span class="identifier">y</span>
- <span class="special">*</span> <span class="identifier">z</span></code>
- is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id656921"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
- the second version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation1</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation2</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
- is convertible to the first argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
- is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
- to the value type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
- </li>
-<li class="listitem">
- The return type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>
- is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
- </li>
-<li class="listitem">
- The return type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>
- is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
-<a name="id657200"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.precondition_">Precondition:</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is a valid range.
- </p>
-<a name="range.reference.algorithms.numeric.inner_product.complexity"></a><h6>
-<a name="id657273"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
- </h6>
-<p>
- Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sum.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,161 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>partial_sum</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../numeric.html" title="Numeric algorithms">
-<link rel="prev" href="inner_product.html" title="inner_product">
-<link rel="next" href="../../ranges.html" title="Provided Ranges">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="inner_product.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="partial_sum">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.partial_sum"></a><a class="link" href="partial_sum.html" title="partial_sum">
- partial_sum</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.partial_sum.prototype"></a><h6>
-<a name="id657341"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">partial_sum</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryOperation</span><span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">partial_sum</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">,</span>
- <span class="identifier">BinaryOperation</span> <span class="identifier">op</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id657593"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">partial_sum</span></code> calculates
- a generalised partial sum of <code class="computeroutput"><span class="identifier">rng</span></code>
- in the same manner as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>. See partial_sum.
- </p>
-<a name="range.reference.algorithms.numeric.partial_sum.definition"></a><h6>
-<a name="id657732"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.numeric.partial_sum.requirements"></a><h6>
-<a name="id657794"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id657818"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
- the first version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
- If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
- value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
- is defined.
- </li>
-<li class="listitem">
- The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
- is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id658016"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
- the second version</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
- </li>
-<li class="listitem">
- The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
- is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
- </li>
-<li class="listitem">
- The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
- is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
- set of value types.
- </li>
-</ol></div>
-<a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id658169"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
- <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
- </p>
-<a name="range.reference.algorithms.numeric.partial_sum.complexity"></a><h6>
-<a name="id658243"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
- </h6>
-<p>
- Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
- then zero applications, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
- applications are performed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="inner_product.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,149 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>next_permutation</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../permutation.html" title="Permutation algorithms">
-<link rel="prev" href="../permutation.html" title="Permutation algorithms">
-<link rel="next" href="prev_permutation.html" title="prev_permutation">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="prev_permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="next_permutation">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.permutation.next_permutation"></a><a class="link" href="next_permutation.html" title="next_permutation">
- next_permutation</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.permutation.next_permutation.prototype"></a><h6>
-<a name="id646664"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id647008"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">next_permutation</span></code> transforms
- the range of elements <code class="computeroutput"><span class="identifier">rng</span></code>
- into the lexicographically next greater permutation of the elements if
- such a permutation exists. If one does not exist then the range is transformed
- into the lexicographically smallest permutation and <code class="computeroutput"><span class="keyword">false</span></code>
- is returned. <code class="computeroutput"><span class="keyword">true</span></code> is returned
- when the next greater permutation is successfully generated.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id647112"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.permutation.next_permutation.requirements"></a><h6>
-<a name="id647184"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id647417"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
- swaps.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="prev_permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,149 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>prev_permutation</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../permutation.html" title="Permutation algorithms">
-<link rel="prev" href="next_permutation.html" title="next_permutation">
-<link rel="next" href="../new.html" title="New algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="next_permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../new.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="prev_permutation">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.permutation.prev_permutation"></a><a class="link" href="prev_permutation.html" title="prev_permutation">
- prev_permutation</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a><h6>
-<a name="id647497"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id647842"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">prev_permutation</span></code> transforms
- the range of elements <code class="computeroutput"><span class="identifier">rng</span></code>
- into the lexicographically next smaller permutation of the elements if
- such a permutation exists. If one does not exist then the range is transformed
- into the lexicographically largest permutation and <code class="computeroutput"><span class="keyword">false</span></code>
- is returned. <code class="computeroutput"><span class="keyword">true</span></code> is returned
- when the next smaller permutation is successfully generated.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id647947"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.permutation.prev_permutation.requirements"></a><h6>
-<a name="id648020"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
- is mutable.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
- value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
- argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id648253"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
- </h6>
-<p>
- Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
- swaps.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="next_permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../new.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/includes.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,186 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>includes</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../set.html" title="Set algorithms">
-<link rel="prev" href="../set.html" title="Set algorithms">
-<link rel="next" href="set_union.html" title="set_union">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../set.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_union.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="includes">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes"> includes</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.set.includes.prototype"></a><h6>
-<a name="id636854"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id637131"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">includes</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if and only if, for every element
- in <code class="computeroutput"><span class="identifier">rng2</span></code>, an equivalent
- element is also present in <code class="computeroutput"><span class="identifier">rng1</span></code>.
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id637228"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.set.includes.requirements"></a><h6>
-<a name="id637298"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id637681"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id637796"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../set.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_union.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_difference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,205 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>set_difference</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../set.html" title="Set algorithms">
-<link rel="prev" href="set_intersection.html" title="set_intersection">
-<link rel="next" href="set_symmetric_difference.html" title="set_symmetric_difference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_symmetric_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="set_difference">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_difference"></a><a class="link" href="set_difference.html" title="set_difference"> set_difference</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_difference.prototype"></a><h6>
-<a name="id640270"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">set_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">set_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id640612"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">set_difference</span></code> constructs
- a sorted range that is the set difference of the sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>.
- The return value is the end of the output range.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id640702"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.set.set_difference.requirements"></a><h6>
-<a name="id640773"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id641207"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.set.set_difference.complexity"></a><h6>
-<a name="id641322"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_symmetric_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,206 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>set_intersection</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../set.html" title="Set algorithms">
-<link rel="prev" href="set_union.html" title="set_union">
-<link rel="next" href="set_difference.html" title="set_difference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_union.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="set_intersection">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_intersection"></a><a class="link" href="set_intersection.html" title="set_intersection">
- set_intersection</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_intersection.prototype"></a><h6>
-<a name="id639094"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id639436"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">set_intersection</span></code> constructs
- a sorted range that is the intersection of the sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>.
- The return value is the end of the output range.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id639526"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.set.set_intersection.requirements"></a><h6>
-<a name="id639597"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id640031"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.set.set_intersection.complexity"></a><h6>
-<a name="id640146"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_union.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,210 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>set_symmetric_difference</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../set.html" title="Set algorithms">
-<link rel="prev" href="set_difference.html" title="set_difference">
-<link rel="next" href="../heap.html" title="Heap algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="set_symmetric_difference">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_symmetric_difference"></a><a class="link" href="set_symmetric_difference.html" title="set_symmetric_difference">
- set_symmetric_difference</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a><h6>
-<a name="id641449"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span>
-<span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span>
-<span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id641792"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">set_symmetric_difference</span></code>
- constructs a sorted range that is the set symmetric difference of the
- sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
- <code class="computeroutput"><span class="identifier">rng2</span></code>. The return value
- is the end of the output range.
- </p>
-<p>
- The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
- by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
- the predicate versions.
- </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id641883"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.requirements"></a><h6>
-<a name="id641955"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id642389"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a><h6>
-<a name="id642506"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/algorithms/set/set_union.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,204 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>set_union</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../set.html" title="Set algorithms">
-<link rel="prev" href="includes.html" title="includes">
-<link rel="next" href="set_intersection.html" title="set_intersection">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="includes.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="set_union">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_union"></a><a class="link" href="set_union.html" title="set_union"> set_union</a>
-</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_union.prototype"></a><h6>
-<a name="id637920"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
- <span class="special">&gt;</span>
-<span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
- </pre>
-<p>
- </p>
-<a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id638262"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">set_union</span></code> constructs
- a sorted range that is the union of the sorted ranges <code class="computeroutput"><span class="identifier">rng1</span></code>
- and <code class="computeroutput"><span class="identifier">rng2</span></code>. The return
- value is the end of the output range. The ordering relationship is determined
- by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>
- in the non-predicate versions, and by evaluating <code class="computeroutput"><span class="identifier">pred</span></code>
- in the predicate versions.
- </p>
-<a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id638349"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.algorithms.set.set_union.requirements"></a><h6>
-<a name="id638421"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-<li class="listitem">
- The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
- as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
- requirements.
- </li>
-</ul></div>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
- <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
- the same value type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
- a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- first argument type.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
- value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
- second argument types.
- </li>
-</ul></div>
-<a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id638855"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
- </h6>
-<p>
- <span class="bold"><strong>For the non-predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>.
- </p>
-<p>
- <span class="bold"><strong>For the predicate versions:</strong></span>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
- according to <code class="computeroutput"><span class="identifier">pred</span></code>.
- </p>
-<a name="range.reference.algorithms.set.set_union.complexity"></a><h6>
-<a name="id638969"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
- </h6>
-<p>
- Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
- where <code class="computeroutput"><span class="identifier">N</span></code> is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="includes.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,48 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range concept implementation</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="overview.html" title="Overview">
-<link rel="next" href="concept_implementation/synopsis.html" title="Synopsis">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation/synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range concept implementation">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.concept_implementation"></a><a class="link" href="concept_implementation.html" title="Range concept implementation"> Range concept
- implementation</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Synopsis</span></dt>
-<dt><span class="section">Semantics</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation/synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,408 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Functions</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../semantics.html" title="Semantics">
-<link rel="prev" href="metafunctions.html" title="Metafunctions">
-<link rel="next" href="../../adaptors.html" title="Range Adaptors">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="metafunctions.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../adaptors.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Functions">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.concept_implementation.semantics.functions"></a><a class="link" href="functions.html" title="Functions">Functions</a>
-</h5></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-<th>
- <p>
- Returns
- </p>
- </th>
-<th>
- <p>
- Complexity
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
- is of type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code> <code class="computeroutput"><span class="identifier">a</span></code>
- if <code class="computeroutput"><span class="identifier">a</span></code> is an
- array <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> if that expression would invoke
- a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code> otherwise
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
- is of type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code> <code class="computeroutput"><span class="identifier">a</span>
- <span class="special">+</span> <span class="identifier">sz</span></code>
- if <code class="computeroutput"><span class="identifier">a</span></code> is an
- array of size <code class="computeroutput"><span class="identifier">sz</span></code>
- <code class="computeroutput"><span class="identifier">range_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- if that expression would invoke a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
- otherwise
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="keyword">bool</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span>
- <span class="special">==</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span>
- <span class="special">-</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">U</span><span class="special">&gt;</span></code> where <code class="computeroutput"><span class="identifier">U</span></code>
- is <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
- if <code class="computeroutput"><span class="identifier">x</span></code> is a pointer
- to a string and <code class="computeroutput"><span class="identifier">U</span></code>
- is <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- otherwise
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">s</span><span class="special">,</span><span class="identifier">s</span>
- <span class="special">+</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">char_traits</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">length</span><span class="special">(</span><span class="identifier">s</span><span class="special">))</span></code> if <code class="computeroutput"><span class="identifier">s</span></code>
- is a <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
- or an array of <code class="computeroutput"><span class="identifier">Char</span></code>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code> otherwise
- </p>
- </td>
-<td>
- <p>
- linear time for pointers to a string or arrays of <code class="computeroutput"><span class="identifier">Char</span></code>, constant time otherwise
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">as_array</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td class="auto-generated">&#160;</td>
-</tr>
-</tbody>
-</table></div>
-<p>
- The special <code class="computeroutput"><span class="identifier">const_</span></code>-named
- functions are useful when you want to document clearly that your code
- is read-only.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">()</span></code>
- can be used <span class="emphasis"><em><span class="bold"><strong>internally</strong></span></em></span>
- in string algorithm libraries such that arrays of characters are handled
- correctly.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">as_array</span><span class="special">()</span></code>
- can be used with string algorithm libraries to make it clear that arrays
- of characters are handled like an array and not like a string.
- </p>
-<p>
- Notice that the above functions should always be called with qualification
- (<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span></code>)
- to prevent <span class="emphasis"><em><span class="bold"><strong>unintended</strong></span></em></span>
- Argument Dependent Lookup (ADL).
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="metafunctions.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../adaptors.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,236 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Metafunctions</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../semantics.html" title="Semantics">
-<link rel="prev" href="../semantics.html" title="Semantics">
-<link rel="next" href="functions.html" title="Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../semantics.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Metafunctions">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.concept_implementation.semantics.metafunctions"></a><a class="link" href="metafunctions.html" title="Metafunctions">Metafunctions</a>
-</h5></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-<th>
- <p>
- Complexity
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
-
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">iterator</span>
-<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
-<span class="identifier">A</span><span class="special">*</span>
-</pre>
-<p>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
-
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">const_iterator</span>
-<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
-<span class="keyword">const</span> <span class="identifier">A</span><span class="special">*</span>
-</pre>
-<p>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_value</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_reference</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_pointer</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_category</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../semantics.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/concept_implementation/synopsis.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,185 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Synopsis</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concept_implementation.html" title="Range concept implementation">
-<link rel="prev" href="../concept_implementation.html" title="Range concept implementation">
-<link rel="next" href="semantics.html" title="Semantics">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Synopsis">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.concept_implementation.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
-</h4></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Single Pass Range metafunctions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_iterator</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_value</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_reference</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_pointer</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_category</span><span class="special">;</span>
-
- <span class="comment">//
-</span> <span class="comment">// Forward Range metafunctions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_difference</span><span class="special">;</span>
-
- <span class="comment">//
-</span> <span class="comment">// Bidirectional Range metafunctions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_reverse_iterator</span><span class="special">;</span>
-
- <span class="comment">//
-</span> <span class="comment">// Single Pass Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">end</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span>
- <span class="identifier">empty</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Forward Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">distance</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Bidirectional Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">rend</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Random Access Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">size</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Special const Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">const_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">const_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">const_rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">const_rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// String utilities
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
- <span class="identifier">as_literal</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
- <span class="identifier">as_literal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">as_array</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">as_array</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,51 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Extending the library</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="utilities/join.html" title="Function join">
-<link rel="next" href="extending/method_1.html" title="Method 1: provide member functions and nested types">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Extending the library">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.extending"></a><a class="link" href="extending.html" title="Extending the library"> Extending the library</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="extending/method_1.html"> Method 1: provide
- member functions and nested types</a></span></dt>
-<dt><span class="section"><a href="extending/method_2.html"> Method 2: provide
- free-standing functions and specialize metafunctions</a></span></dt>
-<dt><span class="section"><a href="extending/method_3.html"> Method 3: provide
- range adaptor implementations</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_1.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,161 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Method 1: provide member functions and nested types</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../extending.html" title="Extending the library">
-<link rel="prev" href="../extending.html" title="Extending the library">
-<link rel="next" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../extending.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_2.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Method 1: provide member functions and nested types">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.extending.method_1"></a><a class="link" href="method_1.html" title="Method 1: provide member functions and nested types"> Method 1: provide
- member functions and nested types</a>
-</h4></div></div></div>
-<p>
- This procedure assumes that you have control over the types that should
- be made conformant to a Range concept. If not, see <a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">method
- 2</a>.
- </p>
-<p>
- The primary templates in this library are implemented such that standard
- containers will work automatically and so will boost::array.
- Below is given an overview of which member functions and member types a
- class must specify to be useable as a certain Range concept.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Member function
- </p>
- </th>
-<th>
- <p>
- Related concept
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- Notice that <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">()</span></code>
- and <code class="computeroutput"><span class="identifier">rend</span><span class="special">()</span></code>
- member functions are not needed even though the container can support bidirectional
- iteration.
- </p>
-<p>
- The required member types are:
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Member type
- </p>
- </th>
-<th>
- <p>
- Related concept
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_iterator</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- Again one should notice that member types <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>
- and <code class="computeroutput"><span class="identifier">const_reverse_iterator</span></code>
- are not needed.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../extending.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_2.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_2.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,267 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Method 2: provide free-standing functions and specialize metafunctions</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../extending.html" title="Extending the library">
-<link rel="prev" href="method_1.html" title="Method 1: provide member functions and nested types">
-<link rel="next" href="method_3.html" title="Method 3: provide range adaptor implementations">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="method_1.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Method 2: provide free-standing functions and specialize metafunctions">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.extending.method_2"></a><a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions"> Method 2: provide
- free-standing functions and specialize metafunctions</a>
-</h4></div></div></div>
-<p>
- This procedure assumes that you cannot (or do not wish to) change the types
- that should be made conformant to a Range concept. If this is not true,
- see <a class="link" href="method_1.html" title="Method 1: provide member functions and nested types">method 1</a>.
- </p>
-<p>
- The primary templates in this library are implemented such that certain
- functions are found via argument-dependent-lookup (ADL). Below is given
- an overview of which free-standing functions a class must specify to be
- useable as a certain Range concept. Let <code class="computeroutput"><span class="identifier">x</span></code>
- be a variable (<code class="computeroutput"><span class="keyword">const</span></code> or <code class="computeroutput"><span class="keyword">mutable</span></code>) of the class in question.
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Function
- </p>
- </th>
-<th>
- <p>
- Related concept
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code>
- and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code>
- must be overloaded for both <code class="computeroutput"><span class="keyword">const</span></code>
- and <code class="computeroutput"><span class="keyword">mutable</span></code> reference arguments.
- </p>
-<p>
- You must also specialize two metafunctions for your type <code class="computeroutput"><span class="identifier">X</span></code>:
- </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Metafunction
- </p>
- </th>
-<th>
- <p>
- Related concept
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_mutable_iterator</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_const_iterator</span></code>
- </p>
- </td>
-<td>
- <p>
- <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass
- Range</a>
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- A complete example is given here:
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="comment">// for std::iterator_traits, std::distance()
-</span>
-<span class="keyword">namespace</span> <span class="identifier">Foo</span>
-<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Our sample UDT. A 'Pair'
-</span> <span class="comment">// will work as a range when the stored
-</span> <span class="comment">// elements are iterators.
-</span> <span class="comment">//
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">Pair</span>
- <span class="special">{</span>
- <span class="identifier">T</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">;</span>
- <span class="special">};</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'Foo'
-</span>
-<span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Specialize metafunctions. We must include the range.hpp header.
-</span> <span class="comment">// We must open the 'boost' namespace.
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_mutable_iterator</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
- <span class="special">{</span>
- <span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
- <span class="special">};</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">struct</span> <span class="identifier">range_const_iterator</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
- <span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Remark: this is defined similar to 'range_iterator'
-</span> <span class="comment">// because the 'Pair' type does not distinguish
-</span> <span class="comment">// between an iterator and a const_iterator.
-</span> <span class="comment">//
-</span> <span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
- <span class="special">};</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span>
-<span class="keyword">namespace</span> <span class="identifier">Foo</span>
-<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// The required functions. These should be defined in
-</span> <span class="comment">// the same namespace as 'Pair', in this case
-</span> <span class="comment">// in namespace 'Foo'.
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_begin</span><span class="special">(</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
- <span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first</span><span class="special">;</span>
- <span class="special">}</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
- <span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">first</span><span class="special">;</span>
- <span class="special">}</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_end</span><span class="special">(</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
- <span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last</span><span class="special">;</span>
- <span class="special">}</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
- <span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
- <span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last</span><span class="special">;</span>
- <span class="special">}</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'Foo'
-</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
-<span class="special">{</span>
- <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">iter</span><span class="special">;</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
- <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span> <span class="identifier">pair</span> <span class="special">=</span> <span class="special">{</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span> <span class="special">};</span>
- <span class="keyword">const</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;&amp;</span> <span class="identifier">cpair</span> <span class="special">=</span> <span class="identifier">pair</span><span class="special">;</span>
- <span class="comment">//
-</span> <span class="comment">// Notice that we call 'begin' etc with qualification.
-</span> <span class="comment">//
-</span> <span class="identifier">iter</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
- <span class="identifier">iter</span> <span class="identifier">e</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
- <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
- <span class="identifier">e</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span> <span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">s</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
- <span class="identifier">s</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span> <span class="keyword">const</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span> <span class="special">&gt;::</span><span class="identifier">type</span>
- <span class="identifier">ri</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">),</span>
- <span class="identifier">re</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
-
- <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="method_1.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Method 3: provide range adaptor implementations</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../extending.html" title="Extending the library">
-<link rel="prev" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
-<link rel="next" href="method_3/method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="method_2.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3/method_3_1.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Method 3: provide range adaptor implementations">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.extending.method_3"></a><a class="link" href="method_3.html" title="Method 3: provide range adaptor implementations"> Method 3: provide
- range adaptor implementations</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="method_3/method_3_1.html"> Method
- 3.1: Implement a Range Adaptor without arguments</a></span></dt>
-<dt><span class="section"><a href="method_3/method_3_2.html"> Method
- 3.2: Implement a Range Adaptor with arguments</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="method_2.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3/method_3_1.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,100 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Method 3.1: Implement a Range Adaptor without arguments</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../method_3.html" title="Method 3: provide range adaptor implementations">
-<link rel="prev" href="../method_3.html" title="Method 3: provide range adaptor implementations">
-<link rel="next" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../method_3.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3_2.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Method 3.1: Implement a Range Adaptor without arguments">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.extending.method_3.method_3_1"></a><a class="link" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments"> Method
- 3.1: Implement a Range Adaptor without arguments</a>
-</h5></div></div></div>
-<p>
- To implement a Range Adaptor without arguments (e.g. reversed) you need
- to:
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
- Provide a range for your return type, for example:
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">reverse_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">R</span> <span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">reverse_range</span> <span class="special">:</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="special">{</span>
-<span class="keyword">private</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">&gt;</span> <span class="identifier">base</span><span class="special">;</span>
-
-<span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span> <span class="identifier">iterator</span><span class="special">;</span>
-
- <span class="identifier">reverse_range</span><span class="special">(</span><span class="identifier">R</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">)</span>
- <span class="special">:</span> <span class="identifier">base</span><span class="special">(</span><span class="identifier">iterator</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)),</span> <span class="identifier">iterator</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">)))</span>
- <span class="special">{</span> <span class="special">}</span>
-<span class="special">};</span>
-</pre>
-</li>
-<li class="listitem">
- Provide a tag to uniquely identify your adaptor in the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
- function overload set
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">detail</span> <span class="special">{</span>
- <span class="keyword">struct</span> <span class="identifier">reverse_forwarder</span> <span class="special">{};</span>
-<span class="special">}</span>
-</pre>
-</li>
-<li class="listitem">
- Implement <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code><pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">BidirectionalRng</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="identifier">BidirectionalRng</span><span class="special">&gt;</span>
-<span class="keyword">operator</span><span class="special">|(</span> <span class="identifier">BidirectionalRng</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="identifier">BidirectionalRng</span><span class="special">&gt;(</span> <span class="identifier">r</span> <span class="special">);</span>
-<span class="special">}</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">BidirectionalRng</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&gt;</span>
-<span class="keyword">operator</span><span class="special">|(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&gt;(</span> <span class="identifier">r</span> <span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../method_3.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3_2.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,155 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Method 3.2: Implement a Range Adaptor with arguments</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../method_3.html" title="Method 3: provide range adaptor implementations">
-<link rel="prev" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
-<link rel="next" href="../../../style_guide.html" title="Terminology and style guidelines">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Method 3.2: Implement a Range Adaptor with arguments">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.extending.method_3.method_3_2"></a><a class="link" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments"> Method
- 3.2: Implement a Range Adaptor with arguments</a>
-</h5></div></div></div>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
- Provide a range for your return type, for example:
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">argument_fwd</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">transform_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="keyword">class</span> <span class="identifier">replace_value</span>
-<span class="special">{</span>
-<span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">result_type</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">argument_type</span><span class="special">;</span>
-
- <span class="identifier">replace_value</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">to</span><span class="special">)</span>
- <span class="special">:</span> <span class="identifier">m_from</span><span class="special">(</span><span class="identifier">from</span><span class="special">),</span> <span class="identifier">m_to</span><span class="special">(</span><span class="identifier">to</span><span class="special">)</span>
- <span class="special">{</span>
- <span class="special">}</span>
-
- <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">()(</span><span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span>
- <span class="special">{</span>
- <span class="keyword">return</span> <span class="special">(</span><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">m_from</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">m_to</span> <span class="special">:</span> <span class="identifier">x</span><span class="special">;</span>
- <span class="special">}</span>
-<span class="keyword">private</span><span class="special">:</span>
- <span class="identifier">Value</span> <span class="identifier">m_from</span><span class="special">;</span>
- <span class="identifier">Value</span> <span class="identifier">m_to</span><span class="special">;</span>
-<span class="special">};</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">&gt;</span>
-<span class="keyword">class</span> <span class="identifier">replace_range</span>
-<span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">transform_iterator</span><span class="special">&lt;</span>
- <span class="identifier">replace_value</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;,</span>
- <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="special">{</span>
-<span class="keyword">private</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">value_type</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">iterator_base</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">replace_value</span><span class="special">&lt;</span><span class="identifier">value_type</span><span class="special">&gt;</span> <span class="identifier">Fn</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">transform_iterator</span><span class="special">&lt;</span><span class="identifier">Fn</span><span class="special">,</span> <span class="identifier">iterator_base</span><span class="special">&gt;</span> <span class="identifier">replaced_iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">replaced_iterator</span><span class="special">&gt;</span> <span class="identifier">base_t</span><span class="special">;</span>
-
-<span class="keyword">public</span><span class="special">:</span>
- <span class="identifier">replace_range</span><span class="special">(</span><span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="identifier">from</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="identifier">to</span><span class="special">)</span>
- <span class="special">:</span> <span class="identifier">base_t</span><span class="special">(</span><span class="identifier">replaced_iterator</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">Fn</span><span class="special">(</span><span class="identifier">from</span><span class="special">,</span><span class="identifier">to</span><span class="special">)),</span>
- <span class="identifier">replaced_iterator</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">Fn</span><span class="special">(</span><span class="identifier">from</span><span class="special">,</span><span class="identifier">to</span><span class="special">)))</span>
- <span class="special">{</span>
- <span class="special">}</span>
- <span class="special">};</span>
-</pre>
-</li>
-<li class="listitem">
- Implement a holder class to hold the arguments required to construct
- the RangeAdaptor.
- </li>
-</ol></div>
-<p>
- The holder combines multiple parameters into one that can be passed as
- the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">class</span> <span class="identifier">replace_holder</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span>
-<span class="special">{</span>
-<span class="keyword">public</span><span class="special">:</span>
- <span class="identifier">replace_holder</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">to</span><span class="special">)</span>
- <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">from</span><span class="special">,</span> <span class="identifier">to</span><span class="special">)</span>
- <span class="special">{</span> <span class="special">}</span>
-<span class="keyword">private</span><span class="special">:</span>
- <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">=(</span><span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&amp;);</span>
-<span class="special">};</span>
-</pre>
-<p>
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
- Define an instance of the holder with the name of the adaptor
- </li></ol></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">static</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;</span>
-<span class="identifier">replaced</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;();</span>
-</pre>
-<p>
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
- Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
-</li></ol></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
-<span class="keyword">operator</span><span class="special">|(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;&amp;</span> <span class="identifier">f</span><span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val1</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val2</span><span class="special">);</span>
-<span class="special">}</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
-<span class="keyword">operator</span><span class="special">|(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;&amp;</span> <span class="identifier">f</span><span class="special">)</span>
-<span class="special">{</span>
- <span class="keyword">return</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val1</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val2</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,48 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Provided Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="algorithms/numeric/partial_sum.html" title="partial_sum">
-<link rel="next" href="ranges/counting_range.html" title="counting_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Provided Ranges">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.ranges"></a><a class="link" href="ranges.html" title="Provided Ranges"> Provided Ranges</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"> counting_range</span></dt>
-<dt><span class="section"> istream_range</span></dt>
-<dt><span class="section"> irange</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/counting_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,90 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>counting_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="../ranges.html" title="Provided Ranges">
-<link rel="next" href="istream_range.html" title="istream_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="counting_range">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range"> counting_range</a>
-</h4></div></div></div>
-<a name="range.reference.ranges.counting_range.prototype"></a><h6>
-<a name="id658363"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Incrementable</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="identifier">Incrementable</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">Incrementable</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Incrementable</span> <span class="identifier">last</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id658736"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">counting_range</span></code> is a function
- to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- wrapping a <code class="computeroutput"><span class="identifier">counting_iterator</span></code>
- (from Boost.Iterator).
- </p>
-<a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id658794"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.definition">Definition</a>
- </h6>
-<p>
- Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">counting_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.ranges.counting_range.requirements"></a><h6>
-<a name="id658856"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-<code class="computeroutput"><span class="identifier">Incrementable</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
- Concept.
- </li></ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/irange.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,103 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>irange</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="istream_range.html" title="istream_range">
-<link rel="next" href="../utilities.html" title="Utilities">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="irange">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.irange"></a><a class="link" href="irange.html" title="irange"> irange</a>
-</h4></div></div></div>
-<a name="range.reference.ranges.irange.prototype"></a><h6>
-<a name="id659288"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">&gt;</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">last</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">StepSize</span><span class="special">&gt;</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator_with_step</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">,</span> <span class="identifier">StepSize</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">StepSize</span> <span class="identifier">step_size</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id659576"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">irange</span></code> is a function to
- generate an Integer Range.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">irange</span></code> allows treating
- integers as a model of the <a class="link" href="../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept. It should be noted that the <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code>
- parameters denoted a half-open range.
- </p>
-<a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id659656"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">irange</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.ranges.irange.requirements"></a><h6>
-<a name="id659718"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">StepSize</span></code> is a model of
- the <code class="computeroutput"><span class="identifier">SignedInteger</span></code> Concept.
- </li>
-</ol></div>
-<a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id659796"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
- </h6>
-<p>
- Constant. Since this function generates a new range the most significant
- performance cost is incurred through the iteration of the generated range.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/ranges/istream_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,72 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>istream_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="counting_range.html" title="counting_range">
-<link rel="next" href="irange.html" title="irange">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="counting_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="istream_range">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range"> istream_range</a>
-</h4></div></div></div>
-<a name="range.reference.ranges.istream_range.prototype"></a><h6>
-<a name="id658929"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Type</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="identifier">istream_range</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_istream</span><span class="special">&lt;</span><span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">in</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id659142"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">istream_range</span></code> is a function
- to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- wrapping a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span></code>.
- </p>
-<a name="range.reference.ranges.istream_range.definition"></a><h6>
-<a name="id659209"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
- </h6>
-<p>
- Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">istream_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="counting_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

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

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/iterator_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,328 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Class iterator_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="../utilities.html" title="Utilities">
-<link rel="next" href="sub_range.html" title="Class sub_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../utilities.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Class iterator_range">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range"> Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
-</h4></div></div></div>
-<p>
- The intention of the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- class is to encapsulate two iterators so they fulfill the <a class="link" href="../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a> concept. A few other functions are also provided for convenience.
- </p>
-<p>
- If the template argument is not a model of <a href="../../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
- Traversal Iterator</a>, one can still use a subset of the interface.
- In particular, <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span></code>
- requires Random Access Traversal Iterators whereas <code class="computeroutput"><span class="identifier">empty</span><span class="special">()</span></code> only requires Single Pass Iterators.
- </p>
-<p>
- Recall that many default constructed iterators are <span class="bold"><strong><span class="emphasis"><em>singular</em></span></strong></span>
- and hence can only be assigned, but not compared or incremented or anything.
- However, if one creates a default constructed <code class="computeroutput"><span class="identifier">iterator_range</span></code>,
- then one can still call all its member functions. This design decision
- avoids the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- imposing limitations upon ranges of iterators that are not singular. Any
- singularity limitation is simply propogated from the underlying iterator
- type.
- </p>
-<a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id660169"></a>
- <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
- </h5>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
- <span class="keyword">class</span> <span class="identifier">iterator_range</span>
- <span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types
-</span> <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">const_iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">End</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span> <span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_begin</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
- <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_end</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
- <span class="keyword">bool</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
-</span> <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="special">};</span>
-
- <span class="comment">// stream output
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span>
- <span class="keyword">operator</span><span class="special">&lt;&lt;(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">Os</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">// comparison
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">// external construction
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
- <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
- <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
- <span class="comment">// convenience
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
-<p>
- </p>
-<p>
- If an instance of <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- is constructed by a client with two iterators, the client must ensure that
- the two iterators delimit a valid closed-open range [begin,end).
- </p>
-<p>
- It is worth noticing that the templated constructors and assignment operators
- allow conversion from <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span></code> to <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code>. Similarly, since the comparison operators
- have two template arguments, we can compare ranges whenever the iterators
- are comparable; for example when we are dealing with const and non-const
- iterators from the same container.
- </p>
-<a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id663315"></a>
- <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
- member functions</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">();</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span>
- <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">&amp;&amp;</span>
- <span class="identifier">end</span><span class="special">()</span>
- <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<a name="range.reference.utilities.iterator_range.details_functions"></a><h5>
-<a name="id663553"></a>
- <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
- functions</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
- <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">l</span><span class="special">)</span> <span class="special">!=</span> <span class="identifier">size</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">?</span> <span class="keyword">false</span> <span class="special">:</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span>
- <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
- <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!(</span> <span class="identifier">l</span> <span class="special">==</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
- <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">lexicographical_compare</span><span class="special">(</span>
- <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">iterator_range</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">new_begin</span> <span class="special">=</span> <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">),</span>
-<span class="identifier">iterator</span> <span class="identifier">new_end</span> <span class="special">=</span> <span class="identifier">end</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">advance_begin</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_end</span><span class="special">,</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-<span class="keyword">return</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">new_end</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span>
- <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">Sequence</span><span class="special">(</span>
- <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../utilities.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/join.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,89 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Function join</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="sub_range.html" title="Class sub_range">
-<link rel="next" href="../extending.html" title="Extending the library">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sub_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Function join">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.utilities.join"></a><a class="link" href="join.html" title="Function join"> Function join</a>
-</h4></div></div></div>
-<p>
- The intention of the <code class="computeroutput"><span class="identifier">join</span></code>
- function is to join two ranges into one longer range.
- </p>
-<p>
- The resultant range will have the lowest common traversal of the two ranges
- supplied as parameters.
- </p>
-<p>
- Note that the joined range incurs a performance cost due to the need to
- check if the end of a range has been reached internally during traversal.
- </p>
-<a name="range.reference.utilities.join.synposis"></a><h5>
-<a name="id666200"></a>
- <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
- </h5>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">add_const</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="special">&gt;</span>
-<span class="identifier">join</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">)</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</span><span class="special">&lt;</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="special">&gt;</span>
-<span class="identifier">join</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.utilities.join.example"></a><h5>
-<a name="id666734"></a>
- <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
- </h5>
-<p>
- The expression <code class="computeroutput"><span class="identifier">join</span><span class="special">(</span><span class="identifier">irange</span><span class="special">(</span><span class="number">0</span><span class="special">,</span><span class="number">5</span><span class="special">),</span> <span class="identifier">irange</span><span class="special">(</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">))</span></code> would
- evaluate to a range representing an integer range <code class="computeroutput"><span class="special">[</span><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">)</span></code>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sub_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/reference/utilities/sub_range.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,123 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Class sub_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="iterator_range.html" title="Class iterator_range">
-<link rel="next" href="join.html" title="Function join">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="iterator_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Class sub_range">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range"> Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
-</h4></div></div></div>
-<p>
- The <code class="computeroutput"><span class="identifier">sub_range</span></code> class inherits
- all its functionality from the <a class="link" href="iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> class. The <code class="computeroutput"><span class="identifier">sub_range</span></code> class is often easier to use
- because one must specify the <a class="link" href="../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a> template argument instead of an iterator. Moreover, the <code class="computeroutput"><span class="identifier">sub_range</span></code> class can propagate constness
- since it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
- is.
- </p>
-<a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id664954"></a>
- <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
- </h5>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
- <span class="keyword">class</span> <span class="identifier">sub_range</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
- <span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">const_iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span> <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
- <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
- <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
- <span class="identifier">sub_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
- <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
- <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">();</span>
- <span class="identifier">const_iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">();</span>
- <span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">();</span>
- <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">();</span>
- <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
-</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
- <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span>
- <span class="comment">// rest of interface inherited from iterator_range
-</span> <span class="special">};</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
-<p>
- </p>
-<p>
- The class should be trivial to use as seen below. Imagine that we have
- an algorithm that searches for a sub-string in a string. The result is
- an iterator_range, that delimits the match. We need to store the result
- from this algorithm. Here is an example of how we can do it with and without
- <code class="computeroutput"><span class="identifier">sub_range</span></code>
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"hello"</span><span class="special">);</span>
-<span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">ir</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
-<span class="identifier">sub_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;</span> <span class="identifier">sub</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="iterator_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/style_guide.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Terminology and style guidelines</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="reference/extending/method_3/method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
-<link rel="next" href="library_headers.html" title="Library Headers">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Terminology and style guidelines">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.style_guide"></a><a class="link" href="style_guide.html" title="Terminology and style guidelines"> Terminology and style guidelines</a>
-</h2></div></div></div>
-<p>
- The use of a consistent terminology is as important for <a class="link" href="concepts.html" title="Range Concepts">Ranges</a>
- and range-based algorithms as it is for iterators and iterator-based algorithms.
- If a conventional set of names are adopted, we can avoid misunderstandings
- and write generic function prototypes that are <span class="bold"><strong><span class="emphasis"><em>self-documenting</em></span></strong></span>.
- </p>
-<p>
- Since ranges are characterized by a specific underlying iterator type, we get
- a type of range for each type of iterator. Hence we can speak of the following
- types of ranges:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- Readable Range
- </li>
-<li class="listitem">
- Writeable Range
- </li>
-<li class="listitem">
- Swappable Range
- </li>
-<li class="listitem">
- Lvalue Range
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem"><a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a></li>
-<li class="listitem"><a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a></li>
-<li class="listitem"><a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a></li>
-<li class="listitem"><a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access Range</a></li>
-</ul></div>
-</li>
-</ul></div>
-<p>
- Notice how we have used the categories from the <a href="../../../../../libs/iterator/doc/new-iter-concepts.html" target="_top">new
- style iterators</a>.
- </p>
-<p>
- Notice that an iterator (and therefore an range) has one <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
- property and one or more properties from the <span class="bold"><strong><span class="emphasis"><em>value
- access</em></span></strong></span> category. So in reality we will mostly talk about
- mixtures such as
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- Random Access Readable Writeable Range
- </li>
-<li class="listitem">
- Forward Lvalue Range
- </li>
-</ul></div>
-<p>
- By convention, we should always specify the <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
- property first as done above. This seems reasonable since there will only be
- one <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span> property,
- but perhaps many <span class="bold"><strong><span class="emphasis"><em>value access</em></span></strong></span>
- properties.
- </p>
-<p>
- It might, however, be reasonable to specify only one category if the other
- category does not matter. For example, the <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> can be constructed
- from a Forward Range. This means that we do not care about what <span class="bold"><strong><span class="emphasis"><em>value
- access</em></span></strong></span> properties the Range has. Similarly, a Readable
- Range will be one that has the lowest possible <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
- property (Single Pass).
- </p>
-<p>
- As another example, consider how we specify the interface of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>. Algorithms are usually more cumbersome to
- specify the interface of since both <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
- and <span class="bold"><strong><span class="emphasis"><em>value access</em></span></strong></span> properties
- must be exactly defined. The iterator-based version looks like this:
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">first</span><span class="special">,</span>
- <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">last</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- For ranges the interface becomes
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessReadableWritableRange</span> <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessReadableWritableRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,49 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Upgrade version of Boost.Range</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="mfc_atl/references.html" title="References">
-<link rel="next" href="upgrade/upgrade_from_1_42.html" title="Upgrade from version 1.42">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Upgrade version of Boost.Range">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.upgrade"></a><a class="link" href="upgrade.html" title="Upgrade version of Boost.Range"> Upgrade version of Boost.Range</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="upgrade/upgrade_from_1_42.html"> Upgrade from version
- 1.42</a></span></dt>
-<dt><span class="section"><a href="upgrade/upgrade_from_1_34.html"> Upgrade from version
- 1.34</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,76 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Upgrade from version 1.34</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="prev" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">
-<link rel="next" href="../portability.html" title="Portability">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="upgrade_from_1_42.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Upgrade from version 1.34">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.upgrade.upgrade_from_1_34"></a><a class="link" href="upgrade_from_1_34.html" title="Upgrade from version 1.34"> Upgrade from version
- 1.34</a>
-</h3></div></div></div>
-<p>
- Boost version 1.35 introduced some larger refactorings of the library:
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
- Direct support for character arrays was abandoned in favor of uniform treatment
- of all arrays. Instead string algorithms can use the new function <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a> now requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>. The old behavior is provided as <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> has been completely removed in favor
- of <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">boost_range_begin</span><span class="special">()</span></code>
- and <code class="computeroutput"><span class="identifier">boost_range_end</span><span class="special">()</span></code>
- have been renamed <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code> respectively.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> and <code class="computeroutput"><span class="identifier">range_reverse_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- have been renamed <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
- and <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
- </li>
-<li class="listitem">
- The procedure that makes a custom type work with the library has been greatly
- simplified. See <a class="link" href="../reference/extending.html" title="Extending the library">Extending the
- library for UDTs</a> for details.
- </li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="upgrade_from_1_42.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html
==============================================================================
--- website/public_html/beta/doc/libs/1_43_0/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,64 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Upgrade from version 1.42</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="next" href="upgrade_from_1_34.html" title="Upgrade from version 1.34">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Upgrade from version 1.42">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.upgrade.upgrade_from_1_42"></a><a class="link" href="upgrade_from_1_42.html" title="Upgrade from version 1.42"> Upgrade from version
- 1.42</a>
-</h3></div></div></div>
-<p>
- New features:
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem"><a class="link" href="../reference/adaptors.html" title="Range Adaptors">Range adaptors</a></li>
-<li class="listitem"><a class="link" href="../reference/algorithms.html" title="Range Algorithm">Range algorithms</a></li>
-</ol></div>
-<p>
- Removed:
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-<code class="computeroutput"><span class="identifier">iterator_range</span></code> no longer
- has a <code class="computeroutput"><span class="identifier">is_singular</span></code> member
- function. The singularity restrictions have been removed from the <code class="computeroutput"><span class="identifier">iterator_range</span></code> class since this added
- restrictions to ranges of iterators whose default constructors were not
- singular. Previously the <code class="computeroutput"><span class="identifier">is_singular</span></code>
- member function always returned <code class="computeroutput"><span class="keyword">false</span></code>
- in release build configurations, hence it is not anticipated that this
- interface change will produce difficulty in upgrading.
- </li></ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- Distributed under the Boost Software License, Version 1.0. (See accompanying
- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_44_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_44_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,779 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/src/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available as pdfs. This
- documentation is <a
- href="http://sourceforge.net/projects/boost/files/boost-docs/1.44.0/">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/factory -
- function object templates for dynamic and static object creation,
- from Tobias Schwinger</li>
- <li>functional/forward -
- adapters to allow generic function objects to accept arbitrary
- arguments, from Tobias Schwinger</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>meta state machine - High-performance expressive UML 2.0 finite state machines, from Christophe Henry.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>polygon - Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates, from
- Lucanus Simonson.</li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - Concepts and utilities for
- range-based algorithms, as well as range-based algorithms and range
- adaptors that allow for efficient and very expressive code, from
- Thorsten Ottosen and Neil Groves.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>result_of - determines the type of a function call expression.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/factory -
- function object templates for dynamic and static object creation,
- from Tobias Schwinger</li>
- <li>functional/forward -
- adapters to allow generic function objects to accept arbitrary
- arguments, from Tobias Schwinger</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>meta state machine - High-performance expressive UML 2.0 finite state machines, from Christophe Henry.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->03 Nov 2009<!--webbot bot="Timestamp" endspan i-checksum="15274" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v2/doc/index.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v2/doc/index.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,818 +0,0 @@
-<html>
-
-<head>
-<meta http-equiv="Content-Language" content="en-us">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-<title>Filesystem Home</title>
-<link rel="stylesheet" type="text/css" href="../../../../doc/src/minimal.css">
-</head>
-
-<body>
-
-<table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" width="710">
- <tr>
- <td width="277">
-<a href="../../../../index.htm">
-<img src="../../../../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="410" align="middle">
- <font size="7">Filesystem Library<br>
- Version 2</font>
- </td>
- </tr>
-</table>
-
-<table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" width="100%">
- <tr>
- <td>Boost Home&nbsp;&nbsp;&nbsp;
- Library Home&nbsp; &nbsp; Tutorial&nbsp; &nbsp; <a href="reference.html">
- Reference</a>&nbsp;&nbsp; FAQ</td>
- </tr>
-</table>
-
-<table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" align="right">
- <tr>
- <td width="100%" bgcolor="#D7EEFF" align="center">
- <i><b>Contents</b></i></td>
- </tr>
- <tr>
- <td width="100%" bgcolor="#E8F5FF">
- Introduction<br>
- Using the library<br>
- Two-minute tutorial<br>
- Cautions<br>
- Example programs<br>
- Implementation<br>
- Macros<br>
- Deprecated names and features<br>
- Using only narrow character paths<br>
- Building the object-library<br>
- &nbsp;&nbsp;&nbsp;&nbsp;Notes for Cygwin users<br>
- Acknowledgements<br>
- Change history</td>
- </tr>
- <tr>
- <td width="100%" bgcolor="#D7EEFF" align="center">
- <i><b>Other Documents</b></i></td>
- </tr>
- <tr>
- <td width="100%" bgcolor="#E8F5FF">
- Reference<br>
- Library Design<br>
- FAQ<br>
- Portability Guide<br>
- Do-list
- </td>
- </tr>
-</table>
-
-<div align="center">
- <center>
- <table border="1" cellpadding="10" cellspacing="1" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td>
- <p align="center"><b>This is Version 2 of the Filesystem library.</b></p>
- <p align="center">Version 3, a major revision with many new and improved
- features, is also available. Version 3 may break some user code written
- for Version 2.</p>
- <p align="center">To ease the transition, Boost releases 1.44 through 1.47
- will supply both V2 and V3. Version 2 is the default version for Boost release 1.44
- and 1.45. Version 3 will be the default starting with release 1.46.</p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 3 to use Version 3. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 3</code>.
- This will be the default for release 1.46 and later.</b></p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 2 to use Version
- 2. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 2</code>.
- This is the default for release 1.44 and 1.45.</b></p>
- <p align="center">Existing code should be moved to version 3 as soon as
- convenient. New code should be written for version 3.</p>
- <p align="center">Version 2 is deprecated, and will not be included in Boost
- releases 1.48 and later.</p>
- </td>
- </tr>
- </table>
- </center>
-</div>
-
-<h2><a name="Introduction">Introduction</a></h2>
-<p>The Boost.Filesystem library provides portable facilities to query and
-manipulate paths, files, and directories.</p>
-
-<p>The motivation for the library is the need to perform portable script-like operations from within C++ programs. The intent is not to
-compete with Python, Perl, or shell languages, but rather to provide portable filesystem
-operations when C++ is already the language of choice. The <a href="design.htm">
-design</a> encourages, but does not require, safe and portable usage.</p>
-
-<p>Programs using the library are <b><i>portable</i></b>, both in the sense that
-the syntax of program code is portable, and the sense that the semantics or
-behavior of code is portable. The <a href="reference.html">generic path
-grammar</a> is another important aid to portability.</p>
-
-<p>Usage is <i><b>safe</b></i> in the sense that errors cannot be ignored since most functions throw C++
-exceptions when errors are detected. This is also convenient for users because
-it alleviates the&nbsp;need to explicitly check error
-return codes.</p>
-
-<p>A proposal,
-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1975.html">
-N1975</a>, to include Boost.Filesystem in Technical Report 2 has been accepted
-by the C++ Standards Committee. The Boost.Filesystem library will stay in
-alignment with the TR2 Filesystem proposal as it works its way through the TR2
-process. Note, however, that namespaces and header granularity differs between
-Boost.Filesystem and the TR2 proposal.</p>
-
-<p>The Boost.Filesystem library provides several&nbsp; headers:</p>
-
-<ul>
- <li>Header &lt;boost/filesystem.hpp&gt; provides class <i>
- basic_path, </i>a portable mechanism for representing
- paths in C++ programs. Typedefs <i>path</i> and <i>
- wpath</i> ease the most common usages of <i>basic_path</i>. Operational
- functions provide useful query and maintenance operations on files and directories.
- Class <i>basic_directory_iterator</i> with typdefs <i>
- directory_iterator</i> and <i>wdirectory_iterator</i> provide iteration over
- the contents of directories. Convenience functions and classes combine lower-level functionality
- in useful ways.<br>
-&nbsp;</li>
- <li>Header &lt;boost/filesystem/fstream.hpp&gt; provides the same components as the C++ Standard
- Library's <i>fstream</i> header, except
- that files are identified by <i>basic_path</i> objects rather that <i>char *</i>'s.</li>
-</ul>
-<h2><a name="Using">Using</a> the library</h2>
-<p>Boost.Filesystem is implemented as a separately compiled library, so before
-using it you must install it in a location that can be found by your linker. See
-Building the object-library. </p>
-<p>The library's example directory contains very simple
-scripts for building the example programs on various
-platforms. You can use these scripts to see what's needed to compile and link
-your own programs.</p>
-<h2>Two-minute <a name="tutorial">tutorial</a></h2>
-<p>(A
-<a href="http://beans.seartipy.com/2006/05/10/boost-filesystem-library-writing-portable-c-programs-to-acess-the-filesystem/">
-more elaborate tutorial</a> is also available from Tabrez Iqbal.)</p>
-<p>First some preliminaries:</p>
-<blockquote>
- <pre>#include &quot;boost/filesystem.hpp&quot; // includes all needed Boost.Filesystem declarations
-#include &lt;iostream&gt; // for std::cout
-using boost::filesystem; // for ease of tutorial presentation;
- // a namespace alias is preferred practice in real code</pre>
-</blockquote>
-<p>A class path object can be created:</p>
-<blockquote>
- <pre>path my_path( &quot;some_dir/file.txt&quot; );</pre>
-</blockquote>
-<p>The string passed to the <i>path</i> constructor may be in a
-portable generic path format or an
-implementation-defined native operating system format. Access functions
-make <i>my_path</i> contents available to the underlying operating system API in an operating system dependent format,
-such as <code>&quot;some_dir:file.txt&quot;</code>, <code>&quot;[some_dir]file.txt&quot;</code>,
-<code>&quot;some_dir/file.txt&quot;</code>, or whatever is appropriate for the
-operating system. If class <i>wpath</i> is used instead of class <i>path</i>,
-translation between wide and narrow character paths is performed automatically
-if necessary for the operating system.</p>
-<p>Class <i>path</i> has conversion constructors from <i>const char*</i> and <i>
-const std:: string&amp;</i>, so that even though the Filesystem Library
-functions used in the following code snippet have <i>const path&amp;</i> formal
-parameters, the user can just
-code C-style strings as actual arguments:</p>
-<blockquote>
- <pre>remove_all( &quot;foobar&quot; );
-create_directory( &quot;foobar&quot; );
-ofstream file( &quot;foobar/cheeze&quot; );
-file &lt;&lt; &quot;tastes good!\n&quot;;
-file.close();
-if ( !exists( &quot;foobar/cheeze&quot; ) )
- std::cout &lt;&lt; &quot;Something is rotten in foobar\n&quot;;</pre>
-</blockquote>
-<p>To make class <i>path</i> objects easy to use in expressions, <i>operator/</i>
-appends paths:</p>
-<blockquote>
- <pre>ifstream file1( arg_path / &quot;foo/bar&quot; );
-ifstream file2( arg_path / &quot;foo&quot; / &quot;bar&quot; );</pre>
-</blockquote>
-<p>The expressions <i>arg_path / &quot;foo/bar&quot;</i> and <i>arg_path / &quot;foo&quot;
-/ &quot;bar&quot;</i> yield identical results.</p>
-<p>Paths can include references to the current directory, using &quot;<code>.</code>&quot;
-notation, and the parent directory, using &quot;<code>..</code>&quot;
-notation.</p>
-<p>Class basic_directory_iterator
-is an important component of the library. It provides an input iterator over the
-contents of a directory, with the value type being class <i>basic_path</i>.
-Typedefs <i>directory_iterator</i> and <i>wdirectory_iterator</i> are provided
-to cover the most common use cases.</p>
-<p>The following function, given a directory path and a file name, recursively
-searches the directory and its sub-directories for the file name, returning a
-bool, and if successful, the path to the file that was found.&nbsp; The code
-below is extracted from a real program, slightly modified for clarity:</p>
-<blockquote>
- <pre>bool find_file( const path &amp; dir_path, // in this directory,
- const std::string &amp; file_name, // search for this name,
- path &amp; path_found ) // placing path here if found
-{
- if ( !exists( dir_path ) ) return false;
- directory_iterator end_itr; // default construction yields past-the-end
- for ( directory_iterator itr( dir_path );
- itr != end_itr;
- ++itr )
- {
- if ( is_directory(itr-&gt;status()) )
- {
- if ( find_file( itr-&gt;path(), file_name, path_found ) ) return true;
- }
- else if ( itr-&gt;path().filename() == file_name ) // see below
- {
- path_found = itr-&gt;path();
- return true;
- }
- }
- return false;
-}</pre>
-</blockquote>
-<p>The expression <i>itr-&gt;path().filename() == file_name</i>, in the line commented <i>//
-see below</i>, calls the <i>filename()</i> function on the <i>path</i> returned by
-calling the <i>path()</i> function of the <i>directory_entry </i>object pointed
-to by the iterator. <i>filename()</i> returns a string which is a copy of the
-last (closest to the leaf, farthest from the root) file or directory name in the
-<i>path</i> object.</p>
-<p>Notice that <i>find_file()</i> does not do explicit error checking, such as
-verifying that the <i>dir_path</i> argument really represents a directory.
-Boost.Filesystem functions throw
-exceptions if they do not complete successfully, so there is enough implicit
-error checking that this application doesn't need to supply additional error
-checking code unless desired. Several Boost.Filesystem functions have non-throwing
-versions, to ease use cases where exceptions would not be appropriate.</p>
-<blockquote>
-<p><i>Note: </i>Recursive
-directory iteration was added as a convenience function after the above tutorial code
-was written, so nowadays you
-don't have to actually code the recursion yourself.</p>
-</blockquote>
-<h2><a name="Cautions">Cautions</a></h2>
-<p>After reading the tutorial you can dive right into simple,
-script-like programs using the Filesystem Library! Before doing any serious
-work, however, there a few cautions to be aware of:</p>
-<h4><b>Effects and Postconditions not guaranteed in the presence of race-conditions</b></h4>
-<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
-effects and postconditions. If
-a race-condition exists, a function's
-postconditions may no longer be true by the time the function returns to the
-caller.</p>
-<blockquote>
-<p><b><i>Explanation: </i></b>The state of files and directories is often
-globally shared, and thus may be changed unexpectedly by other threads,
-processes, or even other computers having network access to the filesystem. As an
-example of the difficulties this can cause, note that the following asserts
-may fail:</p>
-<blockquote>
-<p><code>assert( exists( &quot;foo&quot; ) == exists( &quot;foo&quot; ) );&nbsp; //
-(1)<br>
-<br>
-remove_all( &quot;foo&quot; );<br>
-assert( !exists( &quot;foo&quot; ) );&nbsp; // (2)<br>
-<br>
-assert( is_directory( &quot;foo&quot; ) == is_directory( &quot;foo&quot; ) ); //
-(3)</code></p>
-</blockquote>
-<p>(1) will fail if a non-existent &quot;foo&quot; comes into existence, or an
-existent &quot;foo&quot; is removed, between the first and second call to <i>exists()</i>.
-This could happen if, during the execution of the example code, another thread,
-process, or computer is also performing operations in the same directory.</p>
-<p>(2) will fail if between the call to <i>remove_all()</i> and the call to
-<i>exists()</i> a new file or directory named &quot;foo&quot; is created by another
-thread, process, or computer.</p>
-<p>(3) will fail if another thread, process, or computer removes an
-existing file &quot;foo&quot; and then creates a directory named &quot;foo&quot;, between the
-example code's two calls to <i>is_directory()</i>.</p>
-</blockquote>
-<h4><b>May throw exceptions</b></h4>
-<p>Unless otherwise specified, Boost.Filesystem functions throw <i>
-basic_filesystem_error</i>
-exceptions if they cannot successfully complete their operational
-specifications. Also, implementations may use C++ Standard Library functions,
-which may throw <i>std::bad_alloc</i>. These exceptions may be thrown even
-though the error condition leading to the exception is not explicitly specified
-in the function's &quot;Throws&quot; paragraph.</p>
-<p>All exceptions thrown by the Filesystem
-Library are implemented by calling <a href="../../../utility/throw_exception.html">
-boost::throw_exception()</a>. Thus exact behavior may differ depending on
-BOOST_NO_EXCEPTIONS at the time the filesystem source files are compiled.</p>
-<p>Non-throwing versions are provided of several functions that are often used
-in contexts where error codes may be the preferred way to report an error.</p>
-<h2><a name="Examples">Example programs</a></h2>
-<h3>simple_ls.cpp</h3>
-<p>The example program simple_ls.cpp is
-given a path as a command line argument. Since the command line argument may be
-a relative path, the complete path is determined so that messages displayed
-can be more precise.</p>
-<p>The program checks to see if the path exists; if not a message is printed.</p>
-<p>If the path identifies a directory, the directory is iterated through,
-printing the name of the entries found, and an indication if they are
-directories. A count of directories and files is updated, and then printed after
-the iteration is complete.</p>
-<p>If the path is for a file, a message indicating that is printed.</p>
-<p>Try compiling and executing simple_ls.cpp
-to see how it works on your system. Try various path arguments to see what
-happens.</p>
-<h3>file_size.cpp</h3>
-<p>This example program prints the file's size if it is a regular file.</p>
-<h3>Other examples</h3>
-<p>The programs used to generate the Boost regression test status tables use the
-Filesystem Library extensively.&nbsp; See:</p>
-<ul>
- <li>process_jam_log.cpp</li>
- <li>compiler_status.cpp</li>
-</ul>
-<p>Test programs are sometimes useful in understanding a library, as they
-illustrate what the developer expected to work and not work. See:</p>
-<ul>
- <li>wide_test.cpp</li>
- <li>path_test.cpp</li>
- <li>operations_test.cpp</li>
- <li>fstream_test.cpp</li>
-</ul>
-<h2><a name="Implementation">Implementation</a></h2>
-<p>The current implementation supports operating systems which provide
-either the POSIX or Windows API.</p>
-<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
-Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
-of compilers.</p>
-<h2><a name="Macros">Macros</a></h2>
-<p>Users may defined the following macros if desired. Sensible defaults are
-provided, so users can ignore these macros unless they have special needs.</p>
-<table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td><b><i>Macro Name</i></b></td>
- <td><b><i>Default</i></b></td>
- <td><b><i>Effect if defined</i></b></td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_DYN_LINK</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
- otherwise not defined.</td>
- <td valign="top">Boost.System library is dynamically linked. If not defined,
- static linking is assumed.</td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_NO_LIB</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
- otherwise not defined.</td>
- <td valign="top">Boost.System library does not use the Boost auto-link
- facility.</td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_NARROW_ONLY</code></td>
- <td valign="top">Not defined.</td>
- <td valign="top">Removes features that require wchar_t support.</td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_NO_DEPRECATED</code></td>
- <td valign="top">Not defined.</td>
- <td valign="top">Deprecated features are excluded.</td>
- </tr>
-</table>
-<h2><a name="Deprecated-names">Deprecated names</a> and features</h2>
-<p style="font-size: 10pt">User-defined BOOST_POSIX_API and BOOST_WINDOWS_API
-macros are no longer supported.</p>
-<p style="font-size: 10pt">As the library evolves over time, names sometimes
-change or features are removed. To ease transition, Boost.Filesystem deprecates
-the old names and features, but continues to provide them unless macro <code>
-BOOST_FILESYSTEM_NO_DEPRECATED</code> is defined.</p>
-<table border="1" cellpadding="5" cellspacing="1" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td style="font-size: 10pt">
- <b><i>Component</i></b></td>
- <td style="font-size: 10pt">
- <p style="font-size: 10pt"><b><i>Old name, now deprecated</i></b></td>
- <td style="font-size: 10pt">
- <p style="font-size: 10pt"><b><i>New name</i></b></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top"><code>basic_path</code></td>
- <td style="font-size: 10pt"><code>leaf()</code></td>
- <td style="font-size: 10pt"><code>filename()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top"><code>basic_path</code></td>
- <td style="font-size: 10pt"><code>branch_path()</code></td>
- <td style="font-size: 10pt"><code>parent_path()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top"><code>basic_path</code></td>
- <td style="font-size: 10pt"><code>has_leaf()</code></td>
- <td style="font-size: 10pt"><code>has_filename()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top"><code>basic_path</code></td>
- <td style="font-size: 10pt"><code>has_branch_path()</code></td>
- <td style="font-size: 10pt"><code>has_parent_path()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <p style="font-size: 10pt"><code>remove_leaf()</code></td>
- <td style="font-size: 10pt">
- <p style="font-size: 10pt"><code>remove_filename()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>basic_path( const string_type &amp; str,<br>
-&nbsp; name_check )</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>basic_path( const string_type::value_type * s,<br>
-&nbsp; name_check )</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>native_file_string()</code></td>
- <td style="font-size: 10pt">
- <code>file_string()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>native_directory_string()</code></td>
- <td style="font-size: 10pt">
- <code>directory_string()</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>default_name_check_writable()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>default_name_check( name_check )</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>default_name_check()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>canonize()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_path</code></td>
- <td style="font-size: 10pt">
- <code>normalize()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>operations.hpp</code></td>
- <td style="font-size: 10pt">
- <code>is_regular( file_status f )</code></td>
- <td style="font-size: 10pt">
- <code>is_regular_file( file_status f )</code></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>operations.hpp</code></td>
- <td style="font-size: 10pt">
- <code>symbolic_link_exists( const path &amp; ph )</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_directory_status</code></td>
- <td style="font-size: 10pt">
- <code>filename()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed, use path().filename() instead</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_directory_status</code></td>
- <td style="font-size: 10pt">
- <code>leaf()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed, use path().filename() instead</code></i></td>
- </tr>
- <tr>
- <td style="font-size: 10pt" valign="top">
- <code>basic_directory_status</code></td>
- <td style="font-size: 10pt">
- <code>string()</code></td>
- <td style="font-size: 10pt">
- <i><code>feature removed, use path().string() instead</code></i></td>
- </tr>
-</table>
-<h2><a name="narrow-only">Restricting library to narrow character paths</a></h2>
-<p>Compilers or standard libraries which do not support wide characters (wchar_t)
-or wide character strings (std::wstring) are detected automatically, and cause
-the library to compile code that is restricted to narrow character paths
-(boost::filesystem::path). Users can force this restriction by defining the
-macro BOOST_FILESYSTEM_NARROW_ONLY. That may be useful for dealing with legacy
-compilers or operating systems.</p>
-<h2><a name="Building">Building</a> the object-library</h2>
-<p>The object-library will be built automatically if you are using the Boost
-build system. See
-Getting Started. It can also be
-built manually using a Jamfile
-supplied in directory libs/filesystem/build, or the user can construct an IDE
-project or make file which includes the object-library source files.</p>
-<p>The object-library source files are
-supplied in directory libs/filesystem/src. These source files implement the
-library for POSIX or Windows compatible operating systems; no implementation is
-supplied for other operating systems. Note that many operating systems not
-normally thought of as POSIX systems, such as mainframe legacy
-operating systems or embedded operating systems, support POSIX compatible file
-systems which will work with the Filesystem Library.</p>
-<p>The object-library can be built for static or dynamic (shared/dll) linking.
-This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
-macros. See the <a href="http://www.boost.org/development/separate_compilation.html">Separate
-Compilation</a> page for a description of the techniques used.</p>
-<h3>Note for <a name="Cgywin">Cygwin</a> users</h3>
-<p>The library's implementation code treats Cygwin
-as a Windows platform, and thus uses the Windows API.</p>
-<h2><a name="Acknowledgements">Acknowledgements</a></h2>
-<p>The Filesystem Library was designed and implemented by Beman Dawes. The
-original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
-based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
-was a particular help in later stages of initial development. Peter Dimov and
-Rob Stewart made many useful suggestions and comments over a long period of
-time. Howard Hinnant helped with internationalization issues.</p>
-
-<p>Key design requirements and
-design realities were developed during
-extensive discussions on the Boost mailing list, followed by comments on the
-initial implementation. Numerous helpful comments were then received during the
-Formal Review.<p>Participants included
-Aaron Brashears,
-Alan Bellingham,
-Aleksey Gurtovoy,
-Alex Rosenberg,
-Alisdair Meredith,
-Andy Glew,
-Anthony Williams,
-Baptiste Lepilleur,
-Beman Dawes,
-Bill Kempf,
-Bill Seymour,
-Carl Daniel,
-Chris Little,
-Chuck Allison,
-Craig Henderson,
-Dan Nuffer,
-Dan'l Miller,
-Daniel Frey,
-Darin Adler,
-David Abrahams,
-David Held,
-Davlet Panech,
-Dietmar Kuehl,
-Douglas Gregor,
-Dylan Nicholson,
-Ed Brey,
-Eric Jensen,
-Eric Woodruff,
-Fedder Skovgaard,
-Gary Powell,
-Gennaro Prota,
-Geoff Leyland,
-George Heintzelman,
-Giovanni Bajo,
-Glen Knowles,
-Hillel Sims,
-Howard Hinnant,
-Jaap Suter,
-James Dennett,
-Jan Langer,
-Jani Kajala,
-Jason Stewart,
-Jeff Garland,
-Jens Maurer,
-Jesse Jones,
-Jim Hyslop,
-Joel de Guzman,
-Joel Young,
-John Levon,
-John Maddock,
-John Williston,
-Jonathan Caves,
-Jonathan Biggar,
-Jurko,
-Justus Schwartz,
-Keith Burton,
-Ken Hagen,
-Kostya Altukhov,
-Mark Rodgers,
-Martin Schuerch,
-Matt Austern,
-Matthias Troyer,
-Mattias Flodin,
-Michiel Salters,
-Mickael Pointier,
-Misha Bergal,
-Neal Becker,
-Noel Yap,
-Parksie,
-Patrick Hartling, Pavel Vozenilek,
-Pete Becker,
-Peter Dimov,
-Rainer Deyke,
-Rene Rivera,
-Rob Lievaart,
-Rob Stewart,
-Ron Garcia,
-Ross Smith,
-Sashan,
-Steve Robbins,
-Thomas Witt,
-Tom Harris,
-Toon Knapen,
-Victor Wagner,
-Vincent Finn,
-Vladimir Prus, and
-Yitzhak Sapir
-
-<p>A lengthy discussion on the C++ committee's library reflector illuminated the &quot;illusion
-of portability&quot; problem, particularly in postings by PJ Plauger and Pete Becker.</p>
-
-<p>Walter Landry provided much help illuminating symbolic link use cases for
-version 1.31.0.</p>
-
-<h3>Version 1.34 (i18n) acknowledgements</h3>
-
-<p>So many people have contributed comments and bug reports that it isn't any
-longer possible to acknowledge them individually. That said, Peter Dimov and Rob
-Stewart need to be specially thanked for their many constructive criticisms and
-suggestions. Terence
-Wilson and Chris Frey contributed timing programs which helped illuminate
-performance issues.</p>
-
-<h2><a name="Change-history">Change history</a></h2>
-
-<h3>Version 1.37.0</h3>
-
-<ul>
- <li>Doc fixes: Update release history, add tables of macros and deprecated
- names.</li>
- <li>Bug fix: convenience.hpp didn't fully apply BOOST_FILESYSTEM_NO_DEPRECATED
- to name changes.</li>
- <li>Bug fix: Ticket #1972 'remove' fixes.</li>
- <li>Bug fix: Restore deprecated basic_directory_entry names inadvertently
- removed.</li>
- <li>Bug fix: Provide deprecated functions has_branch_path and has_leaf,
- inadvertently omitted from 1.36.0</li>
- <li>Add workarounds for Codegear/Borland C++ Builder 2009.</li>
-</ul>
-
-<h3>Version 1.36.0 - August 14th, 2008</h3>
-
-<ul>
- <li>Added stem(), extension(), and replace_extension() member functions to
- basic_path, based on the basename(), extension(), and change_extension()
- functions from convenience.hpp.</li>
- <li>Changed path.hpp function names:<ul>
- <li>leaf() -&gt; filename().</li>
- <li>has_leaf() -&gt; has_filename().</li>
- <li>branch_path() -&gt; parent_path().</li>
- <li>has_branch_path() -&gt; has_parent_path().</li>
- <li>remove_leaf() -&gt; remove_filename().</li>
- </ul>
- </li>
- <li>Changed operations.hpp function names:<ul>
- <li>is_regular() -&gt; is_regular_file().</li>
- </ul>
- </li>
- <li>Bug fix: Add path.cpp #include &lt;cwchar&gt;</li>
- <li>Cleared path.hpp gcc shadow warnings.</li>
-</ul>
-
-<h3>Version 1.35.0 - March 29th, 2008</h3>
-
-<ul>
- <li>Diagnostics moved to the separate <a href="../../../system/doc/index.html">
- Boost.System</a> library.</li>
- <li>current_path() function added to set the current directory path.</li>
- <li>Test coverage extended.</li>
- <li>A few minor implementation fixes.</li>
-</ul>
-
-<h3>Version 1.34.1 - July 24th, 2007</h3>
-
-<h3>Version 1.34.0 - May 12th, 2007</h3>
-
-<ul>
- <li>Internationalization, provided by
- class templates <i>basic_path</i>, <i>basic_filesystem_error</i>, and <i>
- basic_directory_iterator</i>.</li>
- <li>Simplification of the path interface,
- including elimination of distinction between native and generic formats,
- and separation of name checking functionality from general path functionality.</li>
- <li>Rationalization of predicate
- function design, including the addition of several new functions.</li>
- <li>Preservation of existing user code whenever
- possible. Deprecated features (<i>symbolic_link_exists()</i>, etc.) remain
- available for legacy code.</li>
- <li>Clearer specification, by reference to [POSIX-01],
- the ISO/IEEE Single Unix Standard, with provisions for Windows and other
- operating systems.</li>
- <li>New functions status,
- symlink_status,
- is_file,
- is_symlink,
- create_hard_link,
- create_symlink, path member and non-member swap, path inserter, path
- extractor, additional path relational and &quot;/&quot; operator overloads, additional
- path member template functions taking iterator arguments.</li>
- <li>More efficient operations when iterating over directories.</li>
- <li>Separation within the implementation of the distinction between the native
- operating system path syntax and API. This is important for CYGWIN users
- because it allows them to build for either the Windows or POSIX API's.</li>
- <li>Numerous small implementation fixes.</li>
-</ul>
-
-<h3>Version 1.33.0 - August 11th, 2005</h3>
-
-<ul>
- <li>Some small implementation fixes.</li>
-</ul>
-
-<h3>Version 1.32.0 - November 19th, 2004</h3>
-
-<ul>
- <li>file_size() function added.</li>
- <li>Class path relational operators added.</li>
- <li>equivalent() function added.</li>
- <li>create_directory() no longer
- throws if the directory already exists. A bool is returned, indicating that
- the directory did not preexist. Similar changes made to
- create_directories().</li>
- <li>Docs added for users wishing Cygwin/POSIX behavior
- on Windows.</li>
- <li>For POSIX, Large File Support (LSF) is enabled if available, such as on
- Linux.</li>
- <li>current_path() and
- initial_path() on POSIX now handle
- very long paths correctly.</li>
-</ul>
-
-<h3>Version 1.31.0 - January 26th, 2004</h3>
-
-<ul>
- <li>The object library can now be built for either
- static or dynamic (shared/dll) linking. </li>
- <li>Several added functions, including improved checking for directory and
- file name portability. See <a href="portability_guide.htm#name_check_functions">
- Name check functions</a>.</li>
- <li>Separation of canonical form and normalized form and a new path member
- function normalize(). This changes behavior,
- in that canonical form is now different, but eliminates a subtle
- bug when symbolic links to
- directories are present.</li>
-</ul>
-
-<h3>&nbsp;<br>
-Version 1.30.0 - March 19th, 2003</h3>
-<ul>
- <li>Initial official Boost version.</li>
-</ul>
-
-<hr>
-<p>Revised
-<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->21 June, 2010<!--webbot bot="Timestamp" endspan i-checksum="19840" --></p>
-
-<p>&copy; Copyright Beman Dawes, 2002-2005</p>
-<p> Use, modification, and distribution are subject to the Boost Software
-License, Version 1.0. See <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a></p>
-
-</body>
-
-</html>
\ No newline at end of file

Deleted: website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v3/doc/index.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_45_0/libs/filesystem/v3/doc/index.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,478 +0,0 @@
-<html>
-
-<head>
-<meta http-equiv="Content-Language" content="en-us">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
-<title>Filesystem Home</title>
-<link rel="stylesheet" type="text/css" href="../../../../doc/src/minimal.css">
-</head>
-
-<body>
-
-<table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
-<a href="../../../../index.htm">
-<img src="../../../../boost.png" alt="boost.png (6897 bytes)" align="middle" width="300" height="86" border="0"></a></td>
- <td align="middle">
- <font size="7">Filesystem Library<br>
- Version 3</font>
- </td>
- </tr>
-</table>
-
-<table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" width="100%">
- <tr>
- <td>Boost Home &nbsp;&nbsp;
- Library Home &nbsp;&nbsp;
- Reference &nbsp;&nbsp;
- Tutorial &nbsp;&nbsp;
- FAQ &nbsp;&nbsp;
- Portability &nbsp;&nbsp;
- V3 Intro &nbsp;&nbsp;
- V3 Design &nbsp;&nbsp;
- Deprecated &nbsp;&nbsp;
- </td>
- </tr>
-</table>
-
-<table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" align="right">
- <tr>
- <td width="100%" bgcolor="#D7EEFF" align="center">
- <i><b>Contents</b></i></td>
- </tr>
- <tr>
- <td width="100%" bgcolor="#E8F5FF">
- Introduction<br>
- Documentation<br>
- Using the library<br>
- Coding guidelines<br>
- Cautions<br>
- Headers<br>
- Example programs<br>
- Implementation<br>
- Macros<br>
- Building the object-library<br>
- Notes for Cygwin users<br>
- <a href="#Change-history">Version history<br>
-&nbsp; with acknowledgements</a></td>
- </tr>
- </table>
-
-<div align="center">
- <center>
- <table border="1" cellpadding="10" cellspacing="1" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td>
- <p align="center"><b>This is the home page for Version 3 of the Filesystem library.</b></p>
- <p align="center">Version 3 is a major revision with many new and improved
- features. It may, however, break some user code written for Version 2.</p>
- <p align="center">To ease the transition, Boost releases 1.44 through 1.47
- will supply both V2 and V3. Version 2
- is the default version for Boost release 1.44
- and 1.45. Version 3 will be the default starting with release 1.46.</p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 3 to use Version 3. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 3</code>.
- This will be the default for release 1.46 and later.</b></p>
- <p align="center"><b>Define macro BOOST_FILESYSTEM_VERSION as 2 to use Version
- 2. You may do this via a
- compiler argument or via <code>#define BOOST_FILESYSTEM_VERSION 2</code>.
- This is the default for release 1.44 and 1.45.</b></p>
- <p align="center">Existing code should be moved to Version 3 as soon as
- convenient. New code should be written for Version 3.</p>
- <p align="center">Version 2 is deprecated, and will not be included in Boost
- releases 1.48 and later.</p>
- </td>
- </tr>
- </table>
- </center>
-</div>
-
-<h2><a name="Introduction">Introduction</a></h2>
-<p>The Boost.Filesystem library provides facilities to manipulate files and directories,
-and the paths that identify them.</p>
-
-<p>The features of the library include:</p>
-
-<ul>
- <li><b>A modern C++ interface, highly compatible with the C++ standard
- library.</b></li>
-</ul>
-<blockquote>
- <blockquote>
-
-<p>Many users say the interface is their primary motivation for using
-Boost.Filesystem. They like its use of familiar idioms based on standard library
-containers, iterators, and algorithms. They like having errors reported by
-throwing exceptions.</p>
-
- </blockquote>
-</blockquote>
-<ul>
- <li><b>Portability between operating systems.</b><br>
-&nbsp;<ul>
- <li>At the C++ syntax level, it is convenient to learn and use one interface
- regardless of the operating system.</li>
- <li>At the semantic level, behavior of code is reasonably portable across
- operating systems.</li>
- <li>Dual generic or native path format support encourages program
- portability, yet still allows communication with users in system specific
- formats.<br>
-&nbsp;</li>
- </ul>
- </li>
- <li><b>Error handling and reporting via C++ exceptions (the default) or error
- codes.</b><br>
-&nbsp;<ul>
- <li>C++ exceptions are the preferred error reporting mechanism for most
- applications. The exception thrown includes the detailed error code
- information important for diagnosing the exact cause of file system errors.</li>
- <li>Error reporting via error code allows user code that provides detailed
- error recovery to avoid becoming so littered with try-catch blocks as to be
- unmaintainable. <br>
-&nbsp;</li>
- </ul>
- </li>
- <li><b>Suitable for a broad spectrum of applications, ranging from simple
- script-like operations to extremely complex production code.</b><br>
-&nbsp;<ul>
- <li>At the simple script-like end of the spectrum, the intent is not to
- compete with Python, Perl, or shell languages, but rather to provide
- filesystem operations when C++ is already the language of choice.</li>
- <li>Finer grained control over operations and error handling is available to
- support more complex applications or other cases where throwing exceptions
- isn't desired.</li>
- </ul>
- </li>
-</ul>
-
-<p>A proposal,
-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1975.html">
-N1975</a>, to include Boost.Filesystem in Technical Report 2 has been accepted
-by the C++ Standards Committee. That proposal was based on version 2 of
-Boost.Filesystem; presumably the final TR2 form will be based on version 3.</p>
-
-<h2><a name="Documentation">Documentation</a></h2>
-
-<p><b>Tutorial</b> - A gentle introduction to
-the library, with example programs provided for you to experiment with.</p>
-
-<p><b>Reference</b> - Formal documentation in the
-style of the C++ standard for
-every component of the library.</p>
-
-<p><b>FAQ</b> - Frequently asked questions.</p>
-
-<p><b>Portability Guide</b> - Help for those
-concerned with writing code to run on multiple operating systems.</p>
-
-<p><b>Deprecated Features</b> - Identifies
-deprecated features and their replacements.</p>
-
-<p><b>Version 3 Introduction</b> - Aimed at users of prior
-Boost.Filesystem versions.</p>
-
-<p><b>Version 3 Design</b> - Historical document
-from the start of the Version 3 design process.</p>
-
-<p><b>Original Design</b> - Historical document from
-the start of the Version 1 design process.</p>
-
-<p><b>Do List</b> - Boost.Filesystem development work
-in the pipeline.</p>
-
-<h2><a name="Using">Using</a> the library</h2>
-<p>Boost.Filesystem is implemented as a separately compiled library, so you must install
-binaries in a location that can be found by your linker. If you followed the
-Boost Getting Started instructions, that's already been done for you.</p>
-<h2><a name="Coding-guidelines">Coding guidelines</a></h2>
-<p>For new code, defining <code>BOOST_FILESYSTEM_NO_DEPRECATED</code> before
-including filesystem headers is strongly recommended. This prevents inadvertent
-use of old features, particularly legacy function names, that have been replaced
-and are going to go away in the future.</p>
-<h2><a name="Cautions">Cautions</a></h2>
-<p>After reading the tutorial you can dive right into simple,
-script-like programs using the Filesystem Library! Before doing any serious
-work, however, there a few cautions to be aware of:</p>
-<h4><b>Effects and Postconditions not guaranteed in the presence of race-conditions</b></h4>
-<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
-effects and postconditions. If
-a race-condition exists, a function's
-postconditions may no longer be true by the time the function returns to the
-caller.</p>
-<blockquote>
-<p><b><i>Explanation: </i></b>The state of files and directories is often
-globally shared, and thus may be changed unexpectedly by other threads,
-processes, or even other computers having network access to the filesystem. As an
-example of the difficulties this can cause, note that the following asserts
-may fail:</p>
-<blockquote>
-<p><code>assert( exists( &quot;foo&quot; ) == exists( &quot;foo&quot; ) );&nbsp; //
-(1)<br>
-<br>
-remove_all( &quot;foo&quot; );<br>
-assert( !exists( &quot;foo&quot; ) );&nbsp; // (2)<br>
-<br>
-assert( is_directory( &quot;foo&quot; ) == is_directory( &quot;foo&quot; ) ); //
-(3)</code></p>
-</blockquote>
-<p>(1) will fail if a non-existent &quot;foo&quot; comes into existence, or an
-existent &quot;foo&quot; is removed, between the first and second call to <i>exists()</i>.
-This could happen if, during the execution of the example code, another thread,
-process, or computer is also performing operations in the same directory.</p>
-<p>(2) will fail if between the call to <i>remove_all()</i> and the call to
-<i>exists()</i> a new file or directory named &quot;foo&quot; is created by another
-thread, process, or computer.</p>
-<p>(3) will fail if another thread, process, or computer removes an
-existing file &quot;foo&quot; and then creates a directory named &quot;foo&quot;, between the
-example code's two calls to <i>is_directory()</i>.</p>
-</blockquote>
-<h4><b>May throw exceptions</b></h4>
-<p>Unless otherwise specified, Boost.Filesystem functions throw <i>
-basic_filesystem_error</i>
-exceptions if they cannot successfully complete their operational
-specifications. Also, implementations may use C++ Standard Library functions,
-which may throw <i>std::bad_alloc</i>. These exceptions may be thrown even
-though the error condition leading to the exception is not explicitly specified
-in the function's &quot;Throws&quot; paragraph.</p>
-<p>All exceptions thrown by the Filesystem
-Library are implemented by calling <a href="../../../utility/throw_exception.html">
-boost::throw_exception()</a>. Thus exact behavior may differ depending on
-BOOST_NO_EXCEPTIONS at the time the filesystem source files are compiled.</p>
-<p>Non-throwing versions are provided of several functions that are often used
-in contexts where error codes may be the preferred way to report an error.</p>
-
-<h2><a name="Headers">Headers</a></h2>
-
-<p>The Boost.Filesystem library provides several&nbsp;headers:</p>
-
-<ul>
- <li>Header &lt;boost/filesystem.hpp&gt;
- provides access to all features of the library, except file streams.<br>
-&nbsp;</li>
- <li>Header &lt;boost/filesystem/fstream.hpp&gt;
- inherits the same components as the C++ Standard
- Library's <i>fstream</i> header, but files are identified by <code>const path&amp;</code>
- arguments rather that <code>const char*</code> arguments.</li>
-</ul>
-<h2><a name="Examples">Example programs</a></h2>
-<p>See the tutorial for example programs.</p>
-<h3>Other examples</h3>
-<p>The programs used to generate the Boost regression test status tables use the
-Filesystem Library extensively.&nbsp; See:</p>
-<ul>
- <li>process_jam_log.cpp</li>
- <li>compiler_status.cpp</li>
-</ul>
-<h2><a name="Implementation">Implementation</a></h2>
-<p>The current implementation supports operating systems which provide
-the POSIX or Windows API's.</p>
-<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
-Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
-of compilers.</p>
-<h2><a name="Macros">Macros</a></h2>
-<p>Users may defined the following macros if desired. Sensible defaults are
-provided, so users can ignore these macros unless they have special needs.</p>
-<table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td><b><i>Macro Name</i></b></td>
- <td><b><i>Default</i></b></td>
- <td><b><i>Effect if defined</i></b></td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_NO_DEPRECATED</code></td>
- <td valign="top">Not defined.</td>
- <td valign="top">Deprecated features are excluded from headers.</td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_DYN_LINK</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
- otherwise not defined.</td>
- <td valign="top">The Boost.Filesystem library is dynamically linked. If not defined,
- static linking is assumed.</td>
- </tr>
- <tr>
- <td valign="top"><code>BOOST_FILESYSTEM_NO_LIB</code></td>
- <td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
- otherwise not defined.</td>
- <td valign="top">Boost.Filesystem library does not use the Boost auto-link
- facility.</td>
- </tr>
- </table>
-<p>User-defined BOOST_POSIX_API and BOOST_WINDOWS_API macros are no longer
-supported.</p>
-<h2><a name="Building">Building</a> the object-library</h2>
-<p>The object-library will be built automatically if you are using the Boost
-build system. See
-Getting Started. It can also be
-built manually using a Jamfile
-supplied in directory libs/filesystem/build, or the user can construct an IDE
-project or make file which includes the object-library source files.</p>
-<p>The object-library source files are
-supplied in directory libs/filesystem/src. These source files implement the
-library for POSIX or Windows compatible operating systems; no implementation is
-supplied for other operating systems. Note that many operating systems not
-normally thought of as POSIX systems, such as mainframe legacy
-operating systems or embedded operating systems, support POSIX compatible file
-systems and so will work with the Filesystem Library.</p>
-<p>The object-library can be built for static or dynamic (shared/dll) linking.
-This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
-macros. See the <a href="http://www.boost.org/development/separate_compilation.html">Separate
-Compilation</a> page for a description of the techniques used.</p>
-<h3>Note for <a name="Cgywin">Cygwin</a> users</h3>
-<p> Cygwin version 1.7 or later is
-required because only versions of GCC with wide character strings are supported.</p>
-
-<p> The library's implementation code treats Cygwin as a Windows platform, and
-thus uses the Windows API and uses Windows path syntax as the native path
-syntax.</p>
-
-<h2><a name="Change-history">Version history</a></h2>
-
-<h3>Version 3</h3>
-
-<p>Boost <span style="background-color: #FFFF00">1.??.0 - ???, 2010</span> - Internationalization via single class <code>path</code>.
-More uniform error handling.</p>
-
-<p>Peter Dimov suggested use of a single path class rather than a <code>basic_path</code>
-class template. That idea was the basis for the Version 3 redesign.</p>
-
-<p>Thanks for comments from Robert Stewart, Zach Laine, Peter Dimov, Gregory
-Peele, Scott McMurray, John Bytheway, Jeff Flinn, Jeffery Bosboom.</p>
-
-<h3>Version 2</h3>
-
-<p>Boost 1.34.0 - May, 2007 - Internationalization via <code>basic_path</code>
-template.</p>
-
-<p>So many people have contributed comments and bug reports that it isn't any
-longer possible to acknowledge them individually. That said, Peter Dimov and Rob
-Stewart need to be specially thanked for their many constructive criticisms and
-suggestions. Terence
-Wilson and Chris Frey contributed timing programs which helped illuminate
-performance issues.</p>
-
-<h3>Version 1</h3>
-
-<p>Boost 1.30.0 - March, 2003 - Initial official Boost release.</p>
-
-<p>The Filesystem Library was designed and implemented by Beman Dawes. The
-original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
-based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
-was a particular help in later stages of initial development. Peter Dimov and
-Rob Stewart made many useful suggestions and comments over a long period of
-time. Howard Hinnant helped with internationalization issues.</p>
-
-<p>Key design requirements and
-design realities were developed during
-extensive discussions on the Boost mailing list, followed by comments on the
-initial implementation. Numerous helpful comments were then received during the
-Formal Review.<p>Participants included
-Aaron Brashears,
-Alan Bellingham,
-Aleksey Gurtovoy,
-Alex Rosenberg,
-Alisdair Meredith,
-Andy Glew,
-Anthony Williams,
-Baptiste Lepilleur,
-Beman Dawes,
-Bill Kempf,
-Bill Seymour,
-Carl Daniel,
-Chris Little,
-Chuck Allison,
-Craig Henderson,
-Dan Nuffer,
-Dan'l Miller,
-Daniel Frey,
-Darin Adler,
-David Abrahams,
-David Held,
-Davlet Panech,
-Dietmar Kuehl,
-Douglas Gregor,
-Dylan Nicholson,
-Ed Brey,
-Eric Jensen,
-Eric Woodruff,
-Fedder Skovgaard,
-Gary Powell,
-Gennaro Prota,
-Geoff Leyland,
-George Heintzelman,
-Giovanni Bajo,
-Glen Knowles,
-Hillel Sims,
-Howard Hinnant,
-Jaap Suter,
-James Dennett,
-Jan Langer,
-Jani Kajala,
-Jason Stewart,
-Jeff Garland,
-Jens Maurer,
-Jesse Jones,
-Jim Hyslop,
-Joel de Guzman,
-Joel Young,
-John Levon,
-John Maddock,
-John Williston,
-Jonathan Caves,
-Jonathan Biggar,
-Jurko,
-Justus Schwartz,
-Keith Burton,
-Ken Hagen,
-Kostya Altukhov,
-Mark Rodgers,
-Martin Schuerch,
-Matt Austern,
-Matthias Troyer,
-Mattias Flodin,
-Michiel Salters,
-Mickael Pointier,
-Misha Bergal,
-Neal Becker,
-Noel Yap,
-Parksie,
-Patrick Hartling, Pavel Vozenilek,
-Pete Becker,
-Peter Dimov,
-Rainer Deyke,
-Rene Rivera,
-Rob Lievaart,
-Rob Stewart,
-Ron Garcia,
-Ross Smith,
-Sashan,
-Steve Robbins,
-Thomas Witt,
-Tom Harris,
-Toon Knapen,
-Victor Wagner,
-Vincent Finn,
-Vladimir Prus, and
-Yitzhak Sapir
-
-<p>A lengthy discussion on the C++ committee's library reflector illuminated the &quot;illusion
-of portability&quot; problem, particularly in postings by PJ Plauger and Pete Becker.</p>
-
-<p>Walter Landry provided much help illuminating symbolic link use cases for
-version 1.31.0.&nbsp;</p>
-
-<hr>
-<p>Revised
-<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->11 June, 2010<!--webbot bot="Timestamp" endspan i-checksum="19839" --></p>
-
-<p>&copy; Copyright Beman Dawes, 2002-2005</p>
-<p> Use, modification, and distribution are subject to the Boost Software
-License, Version 1.0. See <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a></p>
-
-</body>
-
-</html>
\ No newline at end of file

Deleted: website/public_html/beta/doc/libs/1_45_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_45_0/libs/libraries.htm 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,779 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/src/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
- <tr>
- <td width="277">
- <a href="../index.html">
- <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
- <td width="337" align="middle">
- <font size="7">Libraries</font>
- </td>
- </tr>
- </table>
-
- <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
- <tr>
- <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp;
- FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
- </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
- </tr>
- </table>
-
-<dl>
- <dt>Libraries Listed Alphabetically</dt>
- <dt>Libraries Listed by Category</dt>
- <dl>
- <dt>String and text processing</dt>
- <dt>Containers</dt>
- <dt>Iterators</dt>
- <dt>Algorithms</dt>
- <dt>Function Objects and higher-order programming</dt>
- <dt>Generic Programming</dt>
- <dt>Template Metaprogramming</dt>
- <dt>Preprocessor Metaprogramming</dt>
- <dt>Concurrent Programming</dt>
- <dt>Math and numerics</dt>
- <dt>Correctness and testing</dt>
- <dt>Data structures</dt>
- <dt>Image processing</dt>
- <dt>Input/Output<a href="#Memory"></a></dt>
- <dt>Inter-language support</dt>
- <dt>Memory</dt>
- <dt>Parsing</dt>
- <dt>Programming Interfaces</dt>
- <dt>Miscellaneous</dt>
- <dt>Broken compiler workarounds</dt>
- </dl>
- <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started page to find out
-how to download, build, and install the libraries.</p>
-
-<p>Documentation for some Boost libraries is available as pdfs. This
- documentation is <a
- href="https://sourceforge.net/project/showfiles.php?group_id=7586&package_id=159715">available
- on Sourceforge.</a></p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.&nbsp;</li>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
- Dimov.</li>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/factory -
- function object templates for dynamic and static object creation,
- from Tobias Schwinger</li>
- <li>functional/forward -
- adapters to allow generic function objects to accept arbitrary
- arguments, from Tobias Schwinger</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>meta state machine - High-performance expressive UML 2.0 finite state machines, from Christophe Henry.</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease
- OO-programming, from Thorsten Ottosen. </li>
- <li>polygon - Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates, from
- Lucanus Simonson.</li>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>range - Concepts and utilities for
- range-based algorithms, as well as range-based algorithms and range
- adaptors that allow for efficient and very expressive code, from
- Thorsten Ottosen and Neil Groves.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>regex - Regular expression
- library, from John Maddock.</li>
- <li>result_of - determines the type of a function call expression.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>serialization
- - Serialization for persistence and marshalling, from Robert Ramey</li>
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating system support,
- including the diagnostics support that will be part of the C++0x standard
- library, from Beman Dawes.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf and Anthony Williams.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based discriminated union
- container, from Eric Friedman and Itay Maman.</li>
- <li>wave - Standards conformant
- implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
- <li>conversion/lexical_cast - <tt>lexical_cast</tt>
- class template, from Kevlin Henney.</li>
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>regex - Regular expression
- library, from John Maddock</li>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela</li>
- <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
- <li>xpressive - Regular expressions that can be written as strings or as expression templates,
- and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
- <li>array - STL compliant
- container wrapper for arrays of constant size, from
- Nicolai Josuttis.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>circular_buffer - STL compliant
- container also known as ring or cyclic buffer, from Jan Gaspar.</li>
- <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>unordered - unordered associative containers, from Daniel James.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>iterators - Iterator
- construction framework, adaptors, concepts, and more, from Dave
- Abrahams, Jeremy Siek, and Thomas Witt.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>tokenizer - Break of a string or other
- character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
- <li>foreach - BOOST_FOREACH macro for easily
- iterating over the elements of a sequence, from Eric Niebler.</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>graph -
- Generic graph components and algorithms, from Jeremy Siek
- and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
- <li>minmax - standard library
- extensions for simultaneous min/max and min/max element computations,
- from Herv&eacute; Br&ouml;nnimann.</li>
- <li>range - A new infrastructure
- for generic algorithms that builds on top
- of the new iterator concepts, from Thorsten Ottosen.</li>
- <li>string_algo -
- String algorithms library, from Pavol Droba</li>
- <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
- function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
- <li>bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
- <li>functional - Enhanced
- function object adaptors, from Mark Rodgers.</li>
- <li>functional/factory -
- function object templates for dynamic and static object creation,
- from Tobias Schwinger</li>
- <li>functional/forward -
- adapters to allow generic function objects to accept arbitrary
- arguments, from Tobias Schwinger</li>
- <li>functional/hash -
- A TR1 hash function object that can be extended to hash user defined
- types, from Daniel James.</li>
- <li>lambda - Define small unnamed
- function objects at the actual call site, and more, from Jaakko J&auml;rvi and
- Gary Powell.</li>
-
- <li>ref - A utility library for
- passing references to generic functions, from Jaako J&auml;rvi,
- Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
- <li>signals - managed signals &amp;
- slots callback implementation, from Doug Gregor.</li>
- <li>signals2 - managed signals &amp;
- slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
- <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
- <li>call_traits -
- Defines types for passing parameters, from John Maddock,
- Howard Hinnant, et al.</li>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>enable_if -
- Selective inclusion of function template overloads, from Jaakko
- J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
- <li>in_place_factory, typed_in_place_factory- Generic in-place construction
- of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
-
- <li>property map
- - Concepts defining interfaces which map key objects to
- value objects, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
- <li>function_types - Type traits
- for callable, built-in types, from Tobias Schwinger</li>
- <li>fusion -
- Library for working with tuples, including various containers,
- algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
- <li>mpl - Template metaprogramming
- framework of compile-time algorithms, sequences and metafunction classes,
- from Aleksey Gurtovoy.</li>
- <li>proto - Expression template library and compiler
- construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>type_traits -
- Templates for fundamental properties of types, from John
- Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
- <li>preprocessor - Preprocessor
- metaprogramming tools including repetition and recursion, from Vesa Karvonen
- and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>interprocess - Shared memory, memory mapped files,
- process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
- <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
- <li>thread - Portable C++
- multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
- <li>accumulators - Framework for incremental
- calculation, and collection of statistical accumulators, from Eric Niebler.</li>
- <li>integer - Headers to ease
- dealing with integral types.</li>
- <li>interval - Extends the
- usual arithmetic functions to mathematical intervals, from Guillaume
- Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
- <li>math - Several contributions in the
- domain of mathematics, from various authors.</li>
- <li>math/complex number algorithms -
- These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
- <li>math/common_factor - Greatest
- common divisor and least common multiple, from Daryle Walker.</li>
- <li>math/octonion -
- Octonions, from Hubert Holin.</li>
- <li>math/quaternion -
- Quaternions, from Hubert Holin.</li>
- <li>math/special_functions -
- A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
- <li>math/statistical distributions -
- A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
- <li>multi_array - Multidimensional
- containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando </li>
- <li>operators - Templates
- ease arithmetic classes and iterators, from Dave Abrahams
- and Jeremy Siek.</li>
- <li>random - A complete
- system for random number generation, from Jens Maurer.</li>
- <li>rational - A rational
- number class, from Paul Moore.</li>
- <li>uBLAS - Basic linear algebra
- for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
- <li>concept check
- - Tools for generic programming, from Jeremy Siek.</li>
- <li>static_assert
- - Static assertions (compile time assertions), from John
- Maddock.</li>
- <li>test - Support for simple program testing,
- full unit testing, and for program
- execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
- <li>any - Safe, generic container for single
- values of different value types, from Kevlin Henney.</li>
- <li>bimap - Bidirectional maps, from Matias Capeletto.
- </li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>fusion -
- Library for working with tuples, including various containers, algorithms, etc.
- From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
- <li>multi_index - Containers with
- multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
- Mu&ntilde;oz.</li>
- <li>pointer container
- - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
- <li>property tree - A tree data
- structure especially suited to storing configuration data, from Marcin
- Kalicinski and Sebastian Redl.
- <li>tuple - Ease definition of functions returning multiple values, and more,
- from Jaakko J&auml;rvi.</li>
- <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
- <li>variant - Safe, generic, stack-based
- discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
- <li>gil - Generic Image Library, from
- Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
- <li>asio - Portable networking and other low-level
- I/O, including sockets, timers, hostname resolution, socket iostreams, serial
- ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
- <li>assign - Filling containers
- with constant or generated data has never been
- easier, from Thorsten Ottosen.
- </li>
-
- <li>format - Type-safe 'printf-like' format
- operations, from Samuel Krempp.</li>
- <li>io state savers - Save I/O state to
- prevent jumbled data, from Daryle Walker.</li>
- <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
- <li>python - Reflects C++
- classes and functions into <a
- href="http://www.python.org">Python</a>, from Dave
- Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
- <li>pool - Memory pool management, from
- Steve Cleary.</li>
- <li>smart_ptr - Six smart
- pointer class templates, from Greg Colvin, Beman Dawes,
- Peter Dimov, and Darin Adler.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
- <li>spirit - LL parser framework&nbsp;
- represents parsers directly as EBNF grammars in inlined C++, from Joel de
- Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
- <li>function - Function object wrappers
- for deferred calls or callbacks, from Doug Gregor.</li>
-
- <li><span class="library"><a href=
- "parameter/doc/html/index.html">parameter</a></span> -
- Write functions that accept arguments by name, by David Abrahams
- and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
- <li>base-from-member - Idiom to
- initialize a base class with a member, from Daryle Walker.</li>
- <li>compressed_pair
- - Empty member optimization, from John Maddock, Howard
- Hinnant, et al.</li>
- <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
- Kevlin Henney.</li>
- <li>crc - Cyclic Redundancy Code, from Daryle
- Walker.</li>
- <li>date_time - Date-Time library from Jeff Garland.</li>
- <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
- <li>filesystem - Portable paths,
- iteration over directories, and other useful filesystem operations, from
- Beman Dawes.</li>
- <li>flyweight - Design pattern
- to manage large quantities of highly redundant objects,
- from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
- <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
- a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
- <li>meta state machine - High-performance expressive UML 2.0 finite state machines, from Christophe Henry.</li>
- <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
- from Fernando Cacciola.</li>
- <li>optional - Discriminated-union
- wrapper for optional values, from Fernando Cacciola.</li>
- <li>program_options - Access to configuration
- data given on command line, in config files and other sources, from Vladimir Prus.</li>
- <li>scope_exit
- - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
- <li>statechart - Arbitrarily
- complex finite state machines can be implemented in easily readable and
- maintainable C++ code, from Andreas Huber.</li>
- <li>swap -
- Enhanced generic swap function, from Joseph Gauterin.</li>
- <li>system - Operating
- system support, including the diagnostics support that will be part of the
- C++0x standard library, from Beman Dawes.</li>
- <li>timer - Event timer,
- progress timer, and progress display classes, from Beman
- Dawes.</li>
- <li>TR1 - An implementation of the Technical
- Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
- <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
- <li>typeof -
- Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
- <li>units -
- Zero-overhead dimensional analysis and unit/quantity
- manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
- <li>utility - Class <b>noncopyable</b>
- plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
- <b>prior()</b>
- function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
- <li>value_initialized - Wrapper for uniform-syntax value initialization,
- from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
- <li>compatibility - Help for
- non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
- Maurer.</li>
- <li>config - Helps boost
- library developers adapt to compiler idiosyncrasies; not
- intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
- <li>compose - Functional composition adapters for the STL,
- from Nicolai Josuttis. Removed in Boost version 1.32.
- Please use Bind or <a
- href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->03 Nov 2009<!--webbot bot="Timestamp" endspan i-checksum="15274" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>

Deleted: website/public_html/beta/doc/libs/1_46_1/more/getting_started/unix-variants.html
==============================================================================
--- website/public_html/beta/doc/libs/1_46_1/more/getting_started/unix-variants.html 2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,811 +0,0 @@
-<?xml version="1.0" encoding="utf-8" ?>
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
-<meta name="generator" content="Docutils 0.7: http://docutils.sourceforge.net/" />
-<title>Boost Getting Started on Unix Variants</title>
-<meta content="Getting Started with Boost on Unix Variants (including Linux and MacOS)" name="description" />
-<link rel="stylesheet" href="../../rst.css" type="text/css" />
-</head>
-<body>
-<div class="document" id="logo-getting-started-on-unix-variants">
-<h1 class="title"><a class="reference external" href="../../index.htm"><img alt="Boost" class="boost-logo" src="../../boost.png" /></a> Getting Started on Unix Variants</h1>
-
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<!-- maybe we don't need this
-.. Admonition:: A note to Cygwin_ and MinGW_ users
-
- If you plan to build from the Cygwin_ bash shell, you're in the
- right place. If you plan to use your tools from the Windows
- command prompt, you should follow the instructions for `getting
- started on Windows`_. Other command shells, such as MinGW_\ 's
- MSYS, are not supported—they may or may not work.
-
- .. _`Getting Started on Windows`: windows.html
- .. _Cygwin: http://www.cygwin.com
- .. _MinGW: http://mingw.org -->
-<div class="contents topic" id="index">
-<p class="topic-title first">Index</p>
-<ul class="auto-toc simple">
-<li><a class="reference internal" href="#get-boost" id="id19">1&nbsp;&nbsp;&nbsp;Get Boost</a></li>
-<li><a class="reference internal" href="#the-boost-distribution" id="id20">2&nbsp;&nbsp;&nbsp;The Boost Distribution</a></li>
-<li><a class="reference internal" href="#header-only-libraries" id="id21">3&nbsp;&nbsp;&nbsp;Header-Only Libraries</a></li>
-<li><a class="reference internal" href="#build-a-simple-program-using-boost" id="id22">4&nbsp;&nbsp;&nbsp;Build a Simple Program Using Boost</a><ul class="auto-toc">
-<li><a class="reference internal" href="#errors-and-warnings" id="id23">4.1&nbsp;&nbsp;&nbsp;Errors and Warnings</a></li>
-</ul>
-</li>
-<li><a class="reference internal" href="#prepare-to-use-a-boost-library-binary" id="id24">5&nbsp;&nbsp;&nbsp;Prepare to Use a Boost Library Binary</a><ul class="auto-toc">
-<li><a class="reference internal" href="#easy-build-and-install" id="id25">5.1&nbsp;&nbsp;&nbsp;Easy Build and Install</a></li>
-<li><a class="reference internal" href="#or-build-custom-binaries" id="id26">5.2&nbsp;&nbsp;&nbsp;Or, Build Custom Binaries</a><ul class="auto-toc">
-<li><a class="reference internal" href="#install-boost-build" id="id27">5.2.1&nbsp;&nbsp;&nbsp;Install Boost.Build</a></li>
-<li><a class="reference internal" href="#identify-your-toolset" id="id28">5.2.2&nbsp;&nbsp;&nbsp;Identify Your Toolset</a></li>
-<li><a class="reference internal" href="#select-a-build-directory" id="id29">5.2.3&nbsp;&nbsp;&nbsp;Select a Build Directory</a></li>
-<li><a class="reference internal" href="#invoke-bjam" id="id30">5.2.4&nbsp;&nbsp;&nbsp;Invoke <tt class="docutils literal">bjam</tt></a></li>
-</ul>
-</li>
-<li><a class="reference internal" href="#expected-build-output" id="id31">5.3&nbsp;&nbsp;&nbsp;Expected Build Output</a></li>
-<li><a class="reference internal" href="#in-case-of-build-errors" id="id32">5.4&nbsp;&nbsp;&nbsp;In Case of Build Errors</a></li>
-</ul>
-</li>
-<li><a class="reference internal" href="#link-your-program-to-a-boost-library" id="id33">6&nbsp;&nbsp;&nbsp;Link Your Program to a Boost Library</a><ul class="auto-toc">
-<li><a class="reference internal" href="#library-naming" id="id34">6.1&nbsp;&nbsp;&nbsp;Library Naming</a></li>
-<li><a class="reference internal" href="#test-your-program" id="id35">6.2&nbsp;&nbsp;&nbsp;Test Your Program</a></li>
-</ul>
-</li>
-<li><a class="reference internal" href="#conclusion-and-further-resources" id="id36">7&nbsp;&nbsp;&nbsp;Conclusion and Further Resources</a></li>
-</ul>
-</div>
-<div class="section" id="get-boost">
-<h1><a class="toc-backref" href="#id19">1&nbsp;&nbsp;&nbsp;Get Boost</a></h1>
-<p>The most reliable way to get a copy of Boost is to download a
-distribution from <a class="reference external" href="http://www.boost.org/users/history/version_1_46_1.html">SourceForge</a>:</p>
-<ol class="arabic">
-<li><p class="first">Download <a class="reference external" href="http://www.boost.org/users/history/version_1_46_1.html"><tt class="docutils literal">boost_1_46_1</tt><tt class="docutils literal">.tar.bz2</tt></a>.</p>
-</li>
-<li><p class="first">In the directory where you want to put the Boost installation,
-execute</p>
-<pre class="literal-block">
-tar --bzip2 -xf <em>/path/to/</em><tt class="docutils literal">boost_1_46_1</tt>.tar.bz2
-</pre>
-</li>
-</ol>
-<div class="admonition-other-packages admonition">
-<p class="first admonition-title">Other Packages</p>
-<p class="last">RedHat, Debian, and other distribution packagers supply Boost
-library packages, however you may need to adapt these
-instructions if you use third-party packages, because their
-creators usually choose to break Boost up into several packages,
-reorganize the directory structure of the Boost distribution,
-and/or rename the library binaries.<a class="footnote-reference" href="#packagers" id="id2"><sup>1</sup></a> If you have
-any trouble, we suggest using an official Boost distribution
-from <a class="reference external" href="http://www.boost.org/users/history/version_1_46_1.html">SourceForge</a>.</p>
-</div>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="the-boost-distribution">
-<h1><a class="toc-backref" href="#id20">2&nbsp;&nbsp;&nbsp;The Boost Distribution</a></h1>
-<p>This is a sketch of the resulting directory structure:</p>
-<pre class="literal-block">
-<strong>boost_1_46_1</strong><strong>/</strong> .................<em>The “boost root directory”</em>
- <strong>index.htm</strong> .........<em>A copy of www.boost.org starts here</em>
- <strong>boost</strong><strong>/</strong> .........................<em>All Boost Header files</em>
- <tt class="docutils literal"> </tt>
- <strong>libs</strong><strong>/</strong> ............<em>Tests, .cpp</em>s<em>, docs, etc., by library</em>
- <strong>index.html</strong> ........<em>Library documentation starts here</em>
- <strong>algorithm</strong><strong>/</strong>
- <strong>any</strong><strong>/</strong>
- <strong>array</strong><strong>/</strong>
- <em>…more libraries…</em>
- <strong>status</strong><strong>/</strong> .........................<em>Boost-wide test suite</em>
- <strong>tools</strong><strong>/</strong> ...........<em>Utilities, e.g. bjam, quickbook, bcp</em>
- <strong>more</strong><strong>/</strong> ..........................<em>Policy documents, etc.</em>
- <strong>doc</strong><strong>/</strong> ...............<em>A subset of all Boost library docs</em>
-</pre>
-<div class="sidebar">
-<p class="first sidebar-title">Header Organization</p>
-<p class="pre-wrap">The organization of Boost library headers isn't entirely uniform,
-but most libraries follow a few patterns:</p>
-<ul class="pre-wrap last">
-<li><p class="first">Some older libraries and most very small libraries place all
-public headers directly into <tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt>.</p>
-</li>
-<li><p class="first">Most libraries' public headers live in a subdirectory of
-<tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt>, named after the library. For example, you'll find
-the Python library's <tt class="docutils literal">def.hpp</tt> header in</p>
-<pre class="literal-block">
-<tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt><tt class="docutils literal">python</tt><tt class="docutils literal">/</tt><tt class="docutils literal">def.hpp</tt>.
-</pre>
-</li>
-<li><p class="first">Some libraries have an “aggregate header” in <tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt> that
-<tt class="docutils literal">#include</tt>s all of the library's other headers. For
-example, <a class="reference external" href="../../libs/python/doc/building.html">Boost.Python</a>'s aggregate header is</p>
-<pre class="literal-block">
-<tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt><tt class="docutils literal">python.hpp</tt>.
-</pre>
-</li>
-<li><p class="first">Most libraries place private headers in a subdirectory called
-<tt class="docutils literal">detail</tt><tt class="docutils literal">/</tt>, or <tt class="docutils literal">aux_</tt><tt class="docutils literal">/</tt>. Don't expect to find
-anything you can use in these directories.</p>
-</li>
-</ul>
-</div>
-<p>It's important to note the following:</p>
-<ol class="arabic" id="boost-root-directory">
-<li><p class="first">The path to the <strong>boost root directory</strong> (often <tt class="docutils literal">/usr/local/</tt><tt class="docutils literal">boost_1_46_1</tt>) is
-sometimes referred to as <tt class="docutils literal">$BOOST_ROOT</tt> in documentation and
-mailing lists .</p>
-</li>
-<li><p class="first">To compile anything in Boost, you need a directory containing
-the <tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt> subdirectory in your <tt class="docutils literal">#include</tt> path. <tt class="docutils literal"> </tt></p>
-</li>
-<li><p class="first">Since all of Boost's header files have the <tt class="docutils literal">.hpp</tt> extension,
-and live in the <tt class="docutils literal">boost</tt><tt class="docutils literal">/</tt> subdirectory of the boost root, your
-Boost <tt class="docutils literal">#include</tt> directives will look like:</p>
-<pre class="literal-block">
-#include &lt;boost/<em>whatever</em>.hpp&gt;
-</pre>
-<p>or</p>
-<pre class="literal-block">
-#include &quot;boost/<em>whatever</em>.hpp&quot;
-</pre>
-<p>depending on your preference regarding the use of angle bracket
-includes. <tt class="docutils literal"> </tt></p>
-</li>
-<li><p class="first">Don't be distracted by the <tt class="docutils literal">doc</tt><tt class="docutils literal">/</tt> subdirectory; it only
-contains a subset of the Boost documentation. Start with
-<tt class="docutils literal">libs</tt><tt class="docutils literal">/</tt><tt class="docutils literal">index.html</tt> if you're looking for the whole enchilada.</p>
-</li>
-</ol>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="header-only-libraries">
-<h1><a class="toc-backref" href="#id21">3&nbsp;&nbsp;&nbsp;Header-Only Libraries</a></h1>
-<p>The first thing many people want to know is, “how do I build
-Boost?” The good news is that often, there's nothing to build.</p>
-<div class="admonition-nothing-to-build admonition">
-<p class="first admonition-title">Nothing to Build?</p>
-<p class="last">Most Boost libraries are <strong>header-only</strong>: they consist <em>entirely
-of header files</em> containing templates and inline functions, and
-require no separately-compiled library binaries or special
-treatment when linking.</p>
-</div>
-<!-- .. _separate: -->
-<p>The only Boost libraries that <em>must</em> be built separately are:</p>
-<ul class="simple">
-<li><a class="reference external" href="../../libs/filesystem/index.html">Boost.Filesystem</a></li>
-<li><a class="reference external" href="../../libs/graph_parallel/index.html">Boost.GraphParallel</a></li>
-<li><a class="reference external" href="../../libs/iostreams/index.html">Boost.IOStreams</a></li>
-<li><a class="reference external" href="../../libs/mpi/index.html">Boost.MPI</a></li>
-<li><a class="reference external" href="../../libs/program_options/index.html">Boost.ProgramOptions</a></li>
-<li><a class="reference external" href="../../libs/python/doc/building.html">Boost.Python</a> (see the <a class="reference external" href="../../libs/python/doc/building.html">Boost.Python build documentation</a>
-before building and installing it)</li>
-<li><a class="reference external" href="../../libs/regex/index.html">Boost.Regex</a></li>
-<li><a class="reference external" href="../../libs/serialization/index.html">Boost.Serialization</a></li>
-<li><a class="reference external" href="../../libs/signals/index.html">Boost.Signals</a></li>
-<li><a class="reference external" href="../../libs/system/index.html">Boost.System</a></li>
-<li><a class="reference external" href="../../doc/html/thread.html">Boost.Thread</a></li>
-<li><a class="reference external" href="../../libs/wave/index.html">Boost.Wave</a></li>
-</ul>
-<p>A few libraries have optional separately-compiled binaries:</p>
-<ul class="simple">
-<li><a class="reference external" href="../../libs/date_time/index.html">Boost.DateTime</a> has a binary component that is only needed if
-you're using its <tt class="docutils literal">to_string</tt>/<tt class="docutils literal">from_string</tt> or serialization
-features, or if you're targeting Visual C++ 6.x or Borland.</li>
-<li><a class="reference external" href="../../libs/graph/index.html">Boost.Graph</a> also has a binary component that is only needed if
-you intend to <a class="reference external" href="../../libs/graph/doc/read_graphviz.html">parse GraphViz files</a>.</li>
-<li><a class="reference external" href="../../libs/math/index.html">Boost.Math</a> has binary components for the TR1 and C99
-cmath functions.</li>
-<li><a class="reference external" href="../../libs/random/index.html">Boost.Random</a> has a binary component which is only needed if
-you're using <tt class="docutils literal">random_device</tt>.</li>
-<li><a class="reference external" href="../../libs/test/index.html">Boost.Test</a> can be used in “header-only” or “separately compiled”
-mode, although <strong>separate compilation is recommended for serious
-use</strong>.</li>
-</ul>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="build-a-simple-program-using-boost">
-<h1><a class="toc-backref" href="#id22">4&nbsp;&nbsp;&nbsp;Build a Simple Program Using Boost</a></h1>
-<p>To keep things simple, let's start by using a header-only library.
-The following program reads a sequence of integers from standard
-input, uses Boost.Lambda to multiply each number by three, and
-writes them to standard output:</p>
-<pre class="literal-block">
-#include &lt;boost/lambda/lambda.hpp&gt;
-#include &lt;iostream&gt;
-#include &lt;iterator&gt;
-#include &lt;algorithm&gt;
-
-int main()
-{
- using namespace boost::lambda;
- typedef std::istream_iterator&lt;int&gt; in;
-
- std::for_each(
- in(std::cin), in(), std::cout &lt;&lt; (_1 * 3) &lt;&lt; &quot; &quot; );
-}
-</pre>
-<p>Copy the text of this program into a file called <tt class="docutils literal">example.cpp</tt>.</p>
-<p>Now, in the directory where you saved <tt class="docutils literal">example.cpp</tt>, issue the
-following command:</p>
-<pre class="literal-block">
-c++ -I <em>path/to/</em><tt class="docutils literal">boost_1_46_1</tt> example.cpp -o example
-</pre>
-<p>To test the result, type:</p>
-<pre class="literal-block">
-echo 1 2 3 | ./example
-</pre>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="errors-and-warnings">
-<h2><a class="toc-backref" href="#id23">4.1&nbsp;&nbsp;&nbsp;Errors and Warnings</a></h2>
-<p>Don't be alarmed if you see compiler warnings originating in Boost
-headers. We try to eliminate them, but doing so isn't always
-practical.<a class="footnote-reference" href="#warnings" id="id5"><sup>3</sup></a> <strong>Errors are another matter</strong>. If you're
-seeing compilation errors at this point in the tutorial, check to
-be sure you've copied the <a class="reference internal" href="#build-a-simple-program-using-boost">example program</a> correctly and that you've
-correctly identified the <a class="reference internal" href="#boost-root-directory">Boost root directory</a>.</p>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="prepare-to-use-a-boost-library-binary">
-<h1><a class="toc-backref" href="#id24">5&nbsp;&nbsp;&nbsp;Prepare to Use a Boost Library Binary</a></h1>
-<p>If you want to use any of the separately-compiled Boost libraries,
-you'll need to acquire library binaries.</p>
-<div class="section" id="easy-build-and-install">
-<h2><a class="toc-backref" href="#id25">5.1&nbsp;&nbsp;&nbsp;Easy Build and Install</a></h2>
-<p>Issue the following commands in the shell (don't type <tt class="docutils literal">$</tt>; that
-represents the shell's prompt):</p>
-<pre class="literal-block">
-<strong>$</strong> cd <em>path/to/</em><tt class="docutils literal">boost_1_46_1</tt>
-<strong>$</strong> ./bootstrap.sh --help
-</pre>
-<p>Select your configuration options and invoke <tt class="docutils literal">./bootstrap.sh</tt> again
-without the <tt class="docutils literal"><span class="pre">--help</span></tt> option. Unless you have write permission in
-your system's <tt class="docutils literal">/usr/local/</tt> directory, you'll probably want to at
-least use</p>
-<pre class="literal-block">
-<strong>$</strong> ./bootstrap.sh <strong>--prefix=</strong><em>path</em>/<em>to</em>/<em>installation</em>/<em>prefix</em>
-</pre>
-<p>to install somewhere else. Also, consider using the
-<tt class="docutils literal"><span class="pre">--show-libraries</span></tt> and <tt class="docutils literal"><span class="pre">--with-libraries=</span></tt><em>library-name-list</em> options to limit the
-long wait you'll experience if you build everything. Finally,</p>
-<pre class="literal-block">
-<strong>$</strong> ./bjam install
-</pre>
-<p>will leave Boost binaries in the <tt class="docutils literal">lib/</tt> subdirectory of your
-installation prefix. You will also find a copy of the Boost
-headers in the <tt class="docutils literal">include/</tt> subdirectory of the installation
-prefix, so you can henceforth use that directory as an <tt class="docutils literal">#include</tt>
-path in place of the Boost root directory.</p>
-<p><a class="reference internal" href="#link-your-program-to-a-boost-library"><em>skip to the next step</em></a></p>
-</div>
-<div class="section" id="or-build-custom-binaries">
-<h2><a class="toc-backref" href="#id26">5.2&nbsp;&nbsp;&nbsp;Or, Build Custom Binaries</a></h2>
-<p>If you're using a compiler other than your system's default, you'll
-need to use <a class="reference external" href="../../tools/build/index.html">Boost.Build</a> to create binaries.</p>
-<p>You'll also
-use this method if you need a nonstandard build variant (see the
-<a class="reference external" href="../../tools/build/index.html">Boost.Build documentation</a> for more details).</p>
-<div class="admonition-boost-cmake admonition">
-<p class="first admonition-title">Boost.CMake</p>
-<p class="last">There is also an experimental CMake build for boost, supported and distributed
-separately. See the <a class="reference external" href="https://svn.boost.org/trac/boost/wiki/CMake">Boost.CMake</a> wiki page for more information.</p>
-</div>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="install-boost-build">
-<h3><a class="toc-backref" href="#id27">5.2.1&nbsp;&nbsp;&nbsp;Install Boost.Build</a></h3>
-<p><a class="reference external" href="../../tools/build/index.html">Boost.Build</a> is a text-based system for developing, testing, and
-installing software. First, you'll need to build and
-install it. To do this:</p>
-<ol class="arabic simple">
-<li>Go to the directory <tt class="docutils literal">tools</tt><tt class="docutils literal">/</tt><tt class="docutils literal">build</tt><tt class="docutils literal">/</tt><tt class="docutils literal">v2</tt><tt class="docutils literal">/</tt>.</li>
-<li>Run <tt class="docutils literal">bootstrap.sh</tt></li>
-<li>Run <tt class="docutils literal">bjam install <span class="pre">--prefix=</span></tt><em>PREFIX</em> where <em>PREFIX</em> is
-the directory where you want Boost.Build to be installed</li>
-<li>Add <em>PREFIX</em><tt class="docutils literal">/</tt><tt class="docutils literal">bin</tt> to your PATH environment variable.</li>
-</ol>
-</div>
-<div class="section" id="identify-your-toolset">
-<span id="toolset-name"></span><span id="toolset"></span><h3><a class="toc-backref" href="#id28">5.2.2&nbsp;&nbsp;&nbsp;Identify Your Toolset</a></h3>
-<p>First, find the toolset corresponding to your compiler in the
-following table (an up-to-date list is always available <a class="reference external" href="http://www.boost.org/boost-build2/doc/html/bbv2/reference/tools.html">in the
-Boost.Build documentation</a>).</p>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p class="last">If you previously chose a toolset for the purposes of
-<a class="reference external" href="../../doc/html/bbv2/installation.html">building bjam</a>, you should assume it won't work and instead
-choose newly from the table below.</p>
-</div>
-<table border="1" class="docutils">
-<colgroup>
-<col width="18%" />
-<col width="33%" />
-<col width="48%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head">Toolset
-Name</th>
-<th class="head">Vendor</th>
-<th class="head">Notes</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal">acc</tt></td>
-<td>Hewlett Packard</td>
-<td>Only very recent versions are
-known to work well with Boost</td>
-</tr>
-<tr><td><tt class="docutils literal">borland</tt></td>
-<td>Borland</td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="docutils literal">como</tt></td>
-<td>Comeau Computing</td>
-<td>Using this toolset may
-require <a class="reference external" href="../../tools/build/index.html">configuring</a> another
-toolset to act as its backend</td>
-</tr>
-<tr><td><tt class="docutils literal">cw</tt></td>
-<td>Metrowerks/Freescale</td>
-<td>The CodeWarrior compiler. We
-have not tested versions of
-this compiler produced since
-it was sold to Freescale.</td>
-</tr>
-<tr><td><tt class="docutils literal">dmc</tt></td>
-<td>Digital Mars</td>
-<td>As of this Boost release, no
-version of dmc is known to
-handle Boost well.</td>
-</tr>
-<tr><td><tt class="docutils literal">darwin</tt></td>
-<td>Apple Computer</td>
-<td>Apple's version of the GCC
-toolchain with support for
-Darwin and MacOS X features
-such as frameworks.</td>
-</tr>
-<tr><td><tt class="docutils literal">gcc</tt></td>
-<td>The Gnu Project</td>
-<td>Includes support for Cygwin
-and MinGW compilers.</td>
-</tr>
-<tr><td><tt class="docutils literal">hp_cxx</tt></td>
-<td>Hewlett Packard</td>
-<td>Targeted at the Tru64
-operating system.</td>
-</tr>
-<tr><td><tt class="docutils literal">intel</tt></td>
-<td>Intel</td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="docutils literal">msvc</tt></td>
-<td>Microsoft</td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="docutils literal">qcc</tt></td>
-<td>QNX Software Systems</td>
-<td>&nbsp;</td>
-</tr>
-<tr><td><tt class="docutils literal">sun</tt></td>
-<td>Sun</td>
-<td>Only very recent versions are
-known to work well with
-Boost.</td>
-</tr>
-<tr><td><tt class="docutils literal">vacpp</tt></td>
-<td>IBM</td>
-<td>The VisualAge C++ compiler.</td>
-</tr>
-</tbody>
-</table>
-<p>If you have multiple versions of a particular compiler installed,
-you can append the version number to the toolset name, preceded by
-a hyphen, e.g. <tt class="docutils literal"><span class="pre">intel-9.0</span></tt> or
-<tt class="docutils literal"><span class="pre">borland-5.4.3</span></tt>. <tt class="docutils literal"> </tt></p>
-</div>
-<div class="section" id="select-a-build-directory">
-<span id="id10"></span><span id="build-directory"></span><h3><a class="toc-backref" href="#id29">5.2.3&nbsp;&nbsp;&nbsp;Select a Build Directory</a></h3>
-<p><a class="reference external" href="../../tools/build/index.html">Boost.Build</a> will place all intermediate files it generates while
-building into the <strong>build directory</strong>. If your Boost root
-directory is writable, this step isn't strictly necessary: by
-default Boost.Build will create a <tt class="docutils literal">bin.v2/</tt> subdirectory for that
-purpose in your current working directory.</p>
-</div>
-<div class="section" id="invoke-bjam">
-<h3><a class="toc-backref" href="#id30">5.2.4&nbsp;&nbsp;&nbsp;Invoke <tt class="docutils literal">bjam</tt></a></h3>
-<p>Change your current directory to the Boost root directory and
-invoke <tt class="docutils literal">bjam</tt> as follows:</p>
-<pre class="literal-block">
-bjam <strong>--build-dir=</strong><a class="reference internal" href="#id10"><em>build-directory</em></a> <strong>toolset=</strong><a class="reference internal" href="#toolset-name"><em>toolset-name</em></a> <tt class="docutils literal"> </tt> stage
-</pre>
-<p>For a complete description of these and other invocation options,
-please see the <a class="reference external" href="http://www.boost.org/boost-build2/doc/html/bbv2/advanced/invocation.html">Boost.Build documentation</a>.</p>
-<p>For example, your session might look like this:</p>
-<pre class="literal-block">
-$ cd ~/<tt class="docutils literal">boost_1_46_1</tt>
-$ bjam <strong>--build-dir=</strong>/tmp/build-boost <strong>toolset=</strong>gcc stage
-</pre>
-<p>That will build static and shared non-debug multi-threaded variants of the libraries. To build all variants, pass the additional option, “<tt class="docutils literal"><span class="pre">--build-type=complete</span></tt>”.</p>
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<p>Building the special <tt class="docutils literal">stage</tt> target places Boost
-library binaries in the <tt class="docutils literal">stage</tt><tt class="docutils literal">/</tt><tt class="docutils literal">lib</tt><tt class="docutils literal">/</tt> subdirectory of
-the Boost tree. To use a different directory pass the
-<tt class="docutils literal"><span class="pre">--stagedir=</span></tt><em>directory</em> option to <tt class="docutils literal">bjam</tt>.</p>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p class="last"><tt class="docutils literal">bjam</tt> is case-sensitive; it is important that all the
-parts shown in <strong>bold</strong> type above be entirely lower-case.</p>
-</div>
-<p>For a description of other options you can pass when invoking
-<tt class="docutils literal">bjam</tt>, type:</p>
-<pre class="literal-block">
-bjam --help
-</pre>
-<p>In particular, to limit the amount of time spent building, you may
-be interested in:</p>
-<ul class="simple">
-<li>reviewing the list of library names with <tt class="docutils literal"><span class="pre">--show-libraries</span></tt></li>
-<li>limiting which libraries get built with the <tt class="docutils literal"><span class="pre">--with-</span></tt><em>library-name</em> or <tt class="docutils literal"><span class="pre">--without-</span></tt><em>library-name</em> options</li>
-<li>choosing a specific build variant by adding <tt class="docutils literal">release</tt> or
-<tt class="docutils literal">debug</tt> to the command line.</li>
-</ul>
-<div class="note">
-<p class="first admonition-title">Note</p>
-<p class="last">Boost.Build can produce a great deal of output, which can
-make it easy to miss problems. If you want to make sure
-everything is went well, you might redirect the output into a
-file by appending “<tt class="docutils literal">&gt;build.log <span class="pre">2&gt;&amp;1</span></tt>” to your command line.</p>
-</div>
-</div>
-</div>
-<div class="section" id="expected-build-output">
-<h2><a class="toc-backref" href="#id31">5.3&nbsp;&nbsp;&nbsp;Expected Build Output</a></h2>
-<p>During the process of building Boost libraries, you can expect to
-see some messages printed on the console. These may include</p>
-<ul>
-<li><p class="first">Notices about Boost library configuration—for example, the Regex
-library outputs a message about ICU when built without Unicode
-support, and the Python library may be skipped without error (but
-with a notice) if you don't have Python installed.</p>
-</li>
-<li><p class="first">Messages from the build tool that report the number of targets
-that were built or skipped. Don't be surprised if those numbers
-don't make any sense to you; there are many targets per library.</p>
-</li>
-<li><p class="first">Build action messages describing what the tool is doing, which
-look something like:</p>
-<pre class="literal-block">
-<em>toolset-name</em>.c++ <em>long</em>/<em>path</em>/<em>to</em>/<em>file</em>/<em>being</em>/<em>built</em>
-</pre>
-</li>
-<li><p class="first">Compiler warnings.</p>
-</li>
-</ul>
-</div>
-<div class="section" id="in-case-of-build-errors">
-<h2><a class="toc-backref" href="#id32">5.4&nbsp;&nbsp;&nbsp;In Case of Build Errors</a></h2>
-<p>The only error messages you see when building Boost—if any—should
-be related to the IOStreams library's support of zip and bzip2
-formats as described <a class="reference external" href="../../libs/iostreams/doc/installation.html">here</a>. Install the relevant development
-packages for libz and libbz2 if you need those features. Other
-errors when building Boost libraries are cause for concern.</p>
-<p>If it seems like the build system can't find your compiler and/or
-linker, consider setting up a <tt class="docutils literal"><span class="pre">user-config.jam</span></tt> file as described
-<a class="reference external" href="http://www.boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html">here</a>. If that isn't your problem or the <tt class="docutils literal"><span class="pre">user-config.jam</span></tt> file
-doesn't work for you, please address questions about configuring Boost
-for your compiler to the <a class="reference external" href="http://www.boost.org/more/mailing_lists.htm#jamboost">Boost.Build mailing list</a>.</p>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="link-your-program-to-a-boost-library">
-<h1><a class="toc-backref" href="#id33">6&nbsp;&nbsp;&nbsp;Link Your Program to a Boost Library</a></h1>
-<p>To demonstrate linking with a Boost binary library, we'll use the
-following simple program that extracts the subject lines from
-emails. It uses the <a class="reference external" href="../../libs/regex/index.html">Boost.Regex</a> library, which has a
-separately-compiled binary component.</p>
-<pre class="literal-block">
-#include &lt;boost/regex.hpp&gt;
-#include &lt;iostream&gt;
-#include &lt;string&gt;
-
-int main()
-{
- std::string line;
- boost::regex pat( &quot;^Subject: (Re: |Aw: )*(.*)&quot; );
-
- while (std::cin)
- {
- std::getline(std::cin, line);
- boost::smatch matches;
- if (boost::regex_match(line, matches, pat))
- std::cout &lt;&lt; matches[2] &lt;&lt; std::endl;
- }
-}
-</pre>
-<p>There are two main challenges associated with linking:</p>
-<ol class="arabic simple">
-<li>Tool configuration, e.g. choosing command-line options or IDE
-build settings.</li>
-<li>Identifying the library binary, among all the build variants,
-whose compile configuration is compatible with the rest of your
-project.</li>
-</ol>
-<p>There are two main ways to link to libraries:</p>
-<ol class="upperalpha">
-<li><p class="first">You can specify the full path to each library:</p>
-<pre class="literal-block">
-$ c++ -I <em>path/to/</em><tt class="docutils literal">boost_1_46_1</tt> example.cpp -o example <strong>\</strong>
- <strong>~/boost/stage/lib/libboost_regex-gcc34-mt-d-1_36.a</strong>
-</pre>
-</li>
-<li><p class="first">You can separately specify a directory to search (with <tt class="docutils literal"><span class="pre">-L</span></tt><em>directory</em>) and a library name to search for (with <tt class="docutils literal"><span class="pre">-l</span></tt><em>library</em>,<a class="footnote-reference" href="#lowercase-l" id="id14"><sup>2</sup></a> dropping the filename's leading <tt class="docutils literal">lib</tt> and trailing
-suffix (<tt class="docutils literal">.a</tt> in this case):</p>
-<pre class="literal-block">
-$ c++ -I <em>path/to/</em><tt class="docutils literal">boost_1_46_1</tt> example.cpp -o example <strong>\</strong>
- <strong>-L~/boost/stage/lib/ -lboost_regex-gcc34-mt-d-1_36</strong>
-</pre>
-<p>As you can see, this method is just as terse as method A for one
-library; it <em>really</em> pays off when you're using multiple
-libraries from the same directory. Note, however, that if you
-use this method with a library that has both static (<tt class="docutils literal">.a</tt>) and
-dynamic (<tt class="docutils literal">.so</tt>) builds, the system may choose one
-automatically for you unless you pass a special option such as
-<tt class="docutils literal"><span class="pre">-static</span></tt> on the command line.</p>
-</li>
-</ol>
-<p>In both cases above, the bold text is what you'd add to <a class="reference internal" href="#build-a-simple-program-using-boost">the
-command lines we explored earlier</a>.</p>
-<div class="section" id="library-naming">
-<h2><a class="toc-backref" href="#id34">6.1&nbsp;&nbsp;&nbsp;Library Naming</a></h2>
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<p>In order to choose the right binary for your build configuration
-you need to know how Boost binaries are named. Each library
-filename is composed of a common sequence of elements that describe
-how it was built. For example,
-<tt class="docutils literal"><span class="pre">libboost_regex-vc71-mt-d-1_34.lib</span></tt> can be broken down into the
-following elements:</p>
-<dl class="docutils">
-<dt><tt class="docutils literal">lib</tt></dt>
-<dd><em>Prefix</em>: except on Microsoft Windows, every Boost library
-name begins with this string. On Windows, only ordinary static
-libraries use the <tt class="docutils literal">lib</tt> prefix; import libraries and DLLs do
-not.<a class="footnote-reference" href="#distinct" id="id16"><sup>4</sup></a></dd>
-<dt><tt class="docutils literal">boost_regex</tt></dt>
-<dd><em>Library name</em>: all boost library filenames begin with <tt class="docutils literal">boost_</tt>.</dd>
-<dt><tt class="docutils literal"><span class="pre">-vc71</span></tt></dt>
-<dd><em>Toolset tag</em>: identifies the <a class="reference internal" href="#toolset">toolset</a> and version used to build
-the binary.</dd>
-<dt><tt class="docutils literal"><span class="pre">-mt</span></tt></dt>
-<dd><em>Threading tag</em>: indicates that the library was
-built with multithreading support enabled. Libraries built
-without multithreading support can be identified by the absence
-of <tt class="docutils literal"><span class="pre">-mt</span></tt>.</dd>
-<dt><tt class="docutils literal"><span class="pre">-d</span></tt></dt>
-<dd><p class="first"><em>ABI tag</em>: encodes details that affect the library's
-interoperability with other compiled code. For each such
-feature, a single letter is added to the tag:</p>
-<blockquote>
-<table border="1" class="docutils">
-<colgroup>
-<col width="5%" />
-<col width="75%" />
-<col width="20%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head">Key</th>
-<th class="head">Use this library when:</th>
-<th class="head">Boost.Build option</th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal">s</tt></td>
-<td>linking statically to the C++ standard library and compiler runtime support
-libraries.</td>
-<td>runtime-link=static</td>
-</tr>
-<tr><td><tt class="docutils literal">g</tt></td>
-<td>using debug versions of the standard and runtime support libraries.</td>
-<td>runtime-debugging=on</td>
-</tr>
-<tr><td><tt class="docutils literal">y</tt></td>
-<td>using a special <a class="reference external" href="../../libs/python/doc/building.html#variants">debug build of Python</a>.</td>
-<td>python-debugging=on</td>
-</tr>
-<tr><td><tt class="docutils literal">d</tt></td>
-<td>building a debug version of your code.<a class="footnote-reference" href="#debug-abi" id="id17"><sup>5</sup></a></td>
-<td>variant=debug</td>
-</tr>
-<tr><td><tt class="docutils literal">p</tt></td>
-<td>using the STLPort standard library rather than the default one supplied with
-your compiler.</td>
-<td>stdlib=stlport</td>
-</tr>
-</tbody>
-</table>
-</blockquote>
-<p class="last">For example, if you build a debug version of your code for use
-with debug versions of the static runtime library and the
-STLPort standard library in “native iostreams” mode,
-the tag would be: <tt class="docutils literal"><span class="pre">-sgdpn</span></tt>. If none of the above apply, the
-ABI tag is ommitted.</p>
-</dd>
-<dt><tt class="docutils literal"><span class="pre">-1_34</span></tt></dt>
-<dd><em>Version tag</em>: the full Boost release number, with periods
-replaced by underscores. For example, version 1.31.1 would be
-tagged as &quot;-1_31_1&quot;.</dd>
-<dt><tt class="docutils literal">.lib</tt></dt>
-<dd><em>Extension</em>: determined according to the operating system's usual
-convention. On most unix-style platforms the extensions are
-<tt class="docutils literal">.a</tt> and <tt class="docutils literal">.so</tt> for static libraries (archives) and shared
-libraries, respectively. On Windows, <tt class="docutils literal">.dll</tt> indicates a shared
-library and <tt class="docutils literal">.lib</tt> indicates a
-static or import library. Where supported by toolsets on unix
-variants, a full version extension is added (e.g. &quot;.so.1.34&quot;) and
-a symbolic link to the library file, named without the trailing
-version number, will also be created.</dd>
-</dl>
-<!-- .. _Boost.Build toolset names: toolset-name_ -->
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="test-your-program">
-<h2><a class="toc-backref" href="#id35">6.2&nbsp;&nbsp;&nbsp;Test Your Program</a></h2>
-<p>To test our subject extraction, we'll filter the following text
-file. Copy it out of your browser and save it as <tt class="docutils literal">jayne.txt</tt>:</p>
-<pre class="literal-block">
-To: George Shmidlap
-From: Rita Marlowe
-Subject: Will Success Spoil Rock Hunter?

----
-See subject.
-</pre>
-<p>If you linked to a shared library, you may need to prepare some
-platform-specific settings so that the system will be able to find
-and load it when your program is run.  Most platforms have an
-environment variable to which you can add the directory containing
-the library.  On many platforms (Linux, FreeBSD) that variable is
-<tt class="docutils literal">LD_LIBRARY_PATH</tt>, but on MacOS it's <tt class="docutils literal">DYLD_LIBRARY_PATH</tt>, and
-on Cygwin it's simply <tt class="docutils literal">PATH</tt>.  In most shells other than <tt class="docutils literal">csh</tt>
-and <tt class="docutils literal">tcsh</tt>, you can adjust the variable as follows (again, don't
-type the <tt class="docutils literal">$</tt>—that represents the shell prompt):</p>
-<pre class="literal-block">
-<strong>$</strong> <em>VARIABLE_NAME</em>=<em>path/to/lib/directory</em>:${<em>VARIABLE_NAME</em>}
-<strong>$</strong> export <em>VARIABLE_NAME</em>
-</pre>
-<p>On <tt class="docutils literal">csh</tt> and <tt class="docutils literal">tcsh</tt>, it's</p>
-<pre class="literal-block">
-<strong>$</strong> setenv <em>VARIABLE_NAME</em> <em>path/to/lib/directory</em>:${<em>VARIABLE_NAME</em>}
-</pre>
-<p>Once the necessary variable (if any) is set, you can run your
-program as follows:</p>
-<pre class="literal-block">
-<strong>$</strong> <em>path</em>/<em>to</em>/<em>compiled</em>/example &lt; <em>path</em>/<em>to</em>/jayne.txt
-</pre>
-<p>The program should respond with the email subject, “Will Success
-Spoil Rock Hunter?”</p>
-<!-- Copyright David Abrahams 2006. Distributed under the 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 class="section" id="conclusion-and-further-resources">
-<h1><a class="toc-backref" href="#id36">7&nbsp;&nbsp;&nbsp;Conclusion and Further Resources</a></h1>
-<p>This concludes your introduction to Boost and to integrating it
-with your programs.  As you start using Boost in earnest, there are
-surely a few additional points you'll wish we had covered.  One day
-we may have a “Book 2 in the Getting Started series” that addresses
-them.  Until then, we suggest you pursue the following resources.
-If you can't find what you need, or there's anything we can do to
-make this document clearer, please post it to the <a class="reference external" href="http://www.boost.org/more/mailing_lists.htm#users">Boost Users'
-mailing list</a>.</p>
-<ul class="simple">
-<li><a class="reference external" href="../../tools/build/v2/index.html">Boost.Build reference manual</a></li>
-<li><a class="reference external" href="http://www.boost.org/more/mailing_lists.htm#users">Boost Users' mailing list</a></li>
-<li><a class="reference external" href="http://www.boost.org/more/mailing_lists.htm#jamboost">Boost.Build mailing list</a></li>
-<li><a class="reference external" href="../../libs/index.html">Index of all Boost library documentation</a></li>
-</ul>
-<div class="admonition-onward admonition">
-<p class="first admonition-title">Onward</p>
-<blockquote class="epigraph last">
-<p>Good luck, and have fun!</p>
-<p class="attribution">&mdash;the Boost Developers</p>
-</blockquote>
-</div>
-<hr class="docutils" />
-<table class="docutils footnote" frame="void" id="packagers" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id2">[1]</a></td><td>If developers of Boost packages would like to work
-with us to make sure these instructions can be used with their
-packages, we'd be glad to help.  Please make your interest known
-to the <a class="reference external" href="http://www.boost.org/more/mailing_lists.htm#main">Boost developers' list</a>.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="lowercase-l" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id14">[2]</a></td><td>That option is a dash followed by a lowercase “L”
-character, which looks very much like a numeral 1 in some fonts.</td></tr>
-</tbody>
-</table>
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<table class="docutils footnote" frame="void" id="warnings" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id5">[3]</a></td><td>Remember that warnings are specific to each compiler
-implementation.  The developer of a given Boost library might
-not have access to your compiler.  Also, some warnings are
-extremely difficult to eliminate in generic code, to the point
-where it's not worth the trouble.  Finally, some compilers don't
-have any source code mechanism for suppressing warnings.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="distinct" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id16">[4]</a></td><td>This convention distinguishes the static version of
-a Boost library from the import library for an
-identically-configured Boost DLL, which would otherwise have the
-same name.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="debug-abi" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label"><a class="fn-backref" href="#id17">[5]</a></td><td>These libraries were compiled without optimization
-or inlining, with full debug symbols enabled, and without
-<tt class="docutils literal">NDEBUG</tt> <tt class="docutils literal">#define</tt>d.  Although it's true that sometimes
-these choices don't affect binary compatibility with other
-compiled code, you can't count on that with Boost libraries.</td></tr>
-</tbody>
-</table>
-<table class="docutils footnote" frame="void" id="native" rules="none">
-<colgroup><col class="label" /><col /></colgroup>
-<tbody valign="top">
-<tr><td class="label">[6]</td><td>This feature of STLPort is deprecated because it's
-impossible to make it work transparently to the user; we don't
-recommend it.</td></tr>
-</tbody>
-</table>
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<!-- This file contains all the definitions that need to be updated -->
-<!-- for each new release of Boost. -->
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<!-- Copyright David Abrahams 2006. Distributed under the Boost -->
-<!-- Software License, Version 1.0. (See accompanying -->
-<!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -->
-<!-- Copyright David Abrahams 2006. Distributed under the 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>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_48_0/libs/libraries.htm
==============================================================================
--- website/public_html/beta/doc/libs/1_48_0/libs/libraries.htm	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,812 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-
-<head>
-<meta http-equiv="Content-Type"
-content="text/html; charset=iso-8859-1">
-<meta name="ProgId" content="FrontPage.Editor.Document">
-<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
-<title>Boost Libraries</title>
-<link rel="stylesheet" href="../doc/src/boostbook.css" type="text/css" />
-</head>
-
-<body bgcolor="#FFFFFF" text="#000000">
-
-  <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
-    <tr>
-      <td width="277">
-        <a href="../index.html">
-        <img src="../boost.png" alt="boost.png (6897 bytes)" align="middle" width="277" height="86" border="0"></a></td>
-      <td width="337" align="middle">
-        <font size="7">Libraries</font>
-      </td>
-    </tr>
-  </table>
-
-  <table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111" bgcolor="#D7EEFF" height="26" width="673">
-    <tr>
-      <td height="16" width="663">Getting Started&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
-      </font>&nbsp;&nbsp;&nbsp;&nbsp; Tools &nbsp;<font color="#FFFFFF">&nbsp;
-      </font>&nbsp;&nbsp;&nbsp;&nbsp; Web Site&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
-      </font>&nbsp;&nbsp;&nbsp;&nbsp; News&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
-      </font>&nbsp;&nbsp;&nbsp;&nbsp; Community&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
-      </font>&nbsp;&nbsp;&nbsp;&nbsp;
-      FAQ&nbsp;&nbsp;<font color="#FFFFFF">&nbsp;
-      </font>&nbsp;&nbsp;&nbsp;&nbsp; More Info</td>
-    </tr>
-  </table>
-
-<dl>
-  <dt>Libraries Listed Alphabetically</dt>
-  <dt>Libraries Listed by Category</dt>
-    <dl>
-      <dt>String and text processing</dt>
-      <dt>Containers</dt>
-      <dt>Iterators</dt>
-      <dt>Algorithms</dt>
-      <dt>Function Objects and higher-order programming</dt>
-      <dt>Generic Programming</dt>
-      <dt>Template Metaprogramming</dt>
-      <dt>Preprocessor Metaprogramming</dt>
-      <dt>Concurrent Programming</dt>
-      <dt>Math and numerics</dt>
-      <dt>Correctness and testing</dt>
-      <dt>Data structures</dt>
-      <dt>Image processing</dt>
-      <dt>Input/Output<a href="#Memory"></a></dt>
-      <dt>Inter-language support</dt>
-      <dt>Memory</dt>
-      <dt>Parsing</dt>
-      <dt>Programming Interfaces</dt>
-      <dt>Miscellaneous</dt>
-      <dt>Broken compiler workarounds</dt>
-    </dl>
-  <dt>Libraries Retired from Boost</dt>
-</dl>
-
-<p>See Getting Started  page to find out
-how to download, build, and install the libraries.</p>
-
-<hr>
-
-<h2>Libraries Listed <a name="Alphabetically">Alphabetically</a></h2>
-
-<ul>
-    <li>accumulators - Framework for incremental
-        calculation, and collection of statistical accumulators, from Eric Niebler.</li>
-    <li>any - Safe, generic container for single
-      values of different value types, from Kevlin Henney.&nbsp;</li>
-    <li>array - STL compliant
-        container wrapper for arrays of constant size, from
-        Nicolai Josuttis.</li>
-    <li>asio - Portable networking and other low-level
-        I/O, including sockets, timers, hostname resolution, socket iostreams, serial
-        ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
-    <li>assign - Filling containers
-        with constant or generated data has never been
-        easier, from Thorsten Ottosen.
-        </li>
-    <li>bimap - Bidirectional maps, from Matias Capeletto.
-        </li>
-    <li>bind and  mem_fn - Generalized binders for function/object/pointers and member functions, from Peter
-      Dimov.</li>
-    <li>call_traits -
-        Defines types for passing parameters, from John Maddock,
-        Howard Hinnant, et al.</li>
-    <li>chrono - Useful time utilities,
-        from Howard Hinnant, Beman Dawes, Vicente J. Botet Escrib&aacute;.</li>
-    <li>circular_buffer - STL compliant
-        container also known as ring or cyclic buffer, from Jan Gaspar.</li>
-    <li>compatibility - Help for
-      non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
-      Maurer.</li>
-    <li>compressed_pair
-        - Empty member optimization, from John Maddock, Howard
-        Hinnant, et al.</li>
-    <li>concept check
-        - Tools for generic programming, from Jeremy Siek.</li>
-    <li>config - Helps boost
-        library developers adapt to compiler idiosyncrasies; not
-        intended for library users.</li>
-    <li>container - Standard library containers and extensions, from Ion Gazta&ntilde;aga</li>
-    <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
-        Kevlin Henney.</li>
-    <li>crc - Cyclic Redundancy Code, from Daryle
-      Walker.</li>
-    <li>date_time - Date-Time library from Jeff Garland.</li>
-    <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
-    <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
-    <li>enable_if - Selective inclusion of function template overloads, from Jaakko J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
-    <li>filesystem - Portable paths,
-    iteration over directories, and other useful filesystem operations, from
-    Beman Dawes.</li>
-    <li>flyweight - Design pattern
-    to manage large quantities of highly redundant objects,
-    from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
-    <li>foreach - BOOST_FOREACH macro for easily
-    iterating over the elements of a sequence, from Eric Niebler.</li>
-    <li>format - Type-safe 'printf-like' format
-    operations, from Samuel Krempp.</li>
-    <li>function - Function object wrappers
-      for deferred calls or callbacks, from Doug Gregor.</li>
-    <li>function_types - Type traits
-        for callable, built-in types, from Tobias Schwinger</li>
-    <li>functional - Enhanced
-        function object adaptors, from Mark Rodgers.</li>
-    <li>functional/factory -
-        function object templates for dynamic and static object creation,
-        from Tobias Schwinger</li>
-    <li>functional/forward -
-        adapters to allow generic function objects to accept arbitrary
-        arguments, from Tobias Schwinger</li>
-    <li>functional/hash -
-        A TR1 hash function object that can be extended to hash user defined
-        types, from Daniel James.</li>
-    <li>fusion -
-        Library for working with tuples, including various containers, algorithms, etc.
-        From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
-    <li>gil - Generic Image Library, from
-        Lubomir Bourdev and Hailin Jin.</li>
-    <li>geometry - Geometry Library, from
-        Barend Gehrels, Bruno Lalande and Mateusz Loskot.</li>
-    <li>graph -
-        Generic graph components and algorithms, from Jeremy Siek
-        and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
-    <li>icl -
-        Interval Container Library, interval sets and maps and aggregation
-        of associated values, from Joachim Faulhaber.</li>
-    <li>integer - Headers to ease
-        dealing with integral types.</li>
-    <li>interprocess - Shared memory, memory mapped files,
-    process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
-    <li>interval - Extends the
-    usual arithmetic functions to mathematical intervals, from Guillaume
-    Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
-    <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
-    <li>in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
-    <li>io state savers - Save I/O state to
-    prevent jumbled data, from Daryle Walker.</li>
-    <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
-    <li>iterators - Iterator
-        construction framework, adaptors, concepts, and more, from Dave
-        Abrahams, Jeremy Siek, and Thomas Witt.</li>
-    <li>lambda - Define small unnamed
-    function objects at the actual call site, and more, from Jaakko J&auml;rvi and
-    Gary Powell.</li>
-    <li>locale - Provide localization and Unicode
-    handling tools for C++, from Artyom Beilis</li>
-    <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
-    a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
-    <li>math - Several contributions in the
-    domain of mathematics, from various authors.</li>
-    <li>math/complex number algorithms -
-    These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
-    <li>math/common_factor - Greatest
-    common divisor and least common multiple, from Daryle Walker.</li>
-    <li>math/octonion -
-        Octonions, from Hubert Holin.</li>
-    <li>math/quaternion -
-        Quaternions, from Hubert Holin.</li>
-    <li>math/special_functions -
-        A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
-    <li>math/statistical distributions -
-        A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
-    <li>minmax - standard library
-        extensions for simultaneous min/max and min/max element computations,
-    from Herv&eacute; Br&ouml;nnimann.</li>
-    <li>move - Portable move semantics for C++03 and C++1 compilers, from Ion Gazta&ntilde;aga</li>
-    <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
-    <li>mpl - Template metaprogramming
-    framework of compile-time algorithms, sequences and metafunction classes,
-    from Aleksey Gurtovoy.</li>
-    <li>meta state machine - High-performance expressive UML 2.0 finite state machines, from Christophe Henry.</li>
-    <li>multi_array - Multidimensional
-    containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
-    <li>multi_index - Containers with
-    multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
-    Mu&ntilde;oz.</li>
-    <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
-        from Fernando Cacciola.</li>
-    <li>operators - Templates
-        ease arithmetic classes and iterators, from Dave Abrahams
-        and Jeremy Siek.</li>
-    <li>optional - Discriminated-union
-    wrapper for optional values, from Fernando Cacciola.</li>
-
-    <li><span class="library"><a href=
-    "parameter/doc/html/index.html">parameter</a></span> -
-    Write functions that accept arguments by name, by David Abrahams
-    and Daniel Wallin.</li>
-
-    <li>Phoenix - Define small unnamed
-    function objects at the actual call site, and more, from Joel de Guzman, Dan
-    Marsden and Thomas Heller</li>
-    <li>pointer container
-    - Containers for storing heap-allocated polymorphic objects to ease
-      OO-programming, from Thorsten Ottosen. </li>
-    <li>polygon - Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates, from
-      Lucanus Simonson.</li>
-    <li>pool - Memory pool management, from
-      Steve Cleary.</li>
-    <li>preprocessor - Preprocessor
-    metaprogramming tools including repetition and recursion, from Vesa Karvonen
-    and Paul Mensonides.</li>
-    <li>program_options - Access to configuration
-        data given on command line, in config files and other sources, from Vladimir Prus.</li>
-    <li>property map
-        - Concepts defining interfaces which map key objects to
-        value objects, from Jeremy Siek.</li>
-    <li>property tree - A tree data
-        structure especially suited to storing configuration data, from Marcin
-        Kalicinski and Sebastian Redl.
-    <li>proto - Expression template library and compiler
-        construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
-    <li>python - Reflects C++
-        classes and functions into <a
-        href="http://www.python.org">Python</a>, from Dave
-        Abrahams.</li>
-    <li>random - A complete
-        system for random number generation, from Jens Maurer.</li>
-    <li>range - Concepts and utilities for
-        range-based algorithms, as well as range-based algorithms and range
-        adaptors that allow for efficient and very expressive code, from
-        Thorsten Ottosen and Neil Groves.</li>
-    <li>ratio - Compile time rational arithmetic,
-        from Howard Hinnant, Beman Dawes, Vicente J. Botet Escrib&aacute;.</li>
-    <li>rational - A rational
-        number class, from Paul Moore.</li>
-
-    <li>ref - A utility library for
-    passing references to generic functions, from Jaako J&auml;rvi,
-    Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
-    <li>regex - Regular expression
-        library, from John Maddock.</li>
-    <li>result_of - determines the type of a function call expression.</li>
-    <li>scope_exit
-        - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
-    <li>serialization
-        - Serialization for persistence and marshalling, from Robert Ramey</li>
-    <li>signals - managed signals &amp;
-         slots callback implementation, from Doug Gregor.</li>
-    <li>signals2 - managed signals &amp;
-         slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-    <li>smart_ptr - Six smart
-        pointer class templates, from Greg Colvin, Beman Dawes,
-        Peter Dimov, and Darin Adler.</li>
-    <li>statechart - Arbitrarily
-    complex finite state machines can be implemented in easily readable and
-    maintainable C++ code, from Andreas Huber.</li>
-    <li>static_assert
-        - Static assertions (compile time assertions), from John
-        Maddock.</li>
-    <li>spirit - LL parser framework&nbsp;
-    represents parsers directly as EBNF grammars in inlined C++, from Joel de
-    Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-    <li>string_algo -
-    String algorithms library, from Pavol Droba.</li>
-    <li>swap -
-    Enhanced generic swap function, from Joseph Gauterin.</li>
-    <li>system - Operating system support,
-    including the diagnostics support that will be part of the C++0x standard
-    library, from Beman Dawes.</li>
-    <li>test - Support for simple program testing,
-    full unit testing, and for program
-      execution monitoring, from Gennadiy Rozental.</li>
-    <li>thread - Portable C++
-      multi-threading, from William Kempf and Anthony Williams.</li>
-    <li>timer - Event timer,
-        progress timer, and progress display classes, from Beman
-        Dawes.</li>
-    <li>tokenizer - Break of a string or other
-      character sequence into a series of tokens, from John Bandela.</li>
-    <li>TR1 - An implementation of the Technical
-        Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
-    <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
-    <li>tuple - Ease definition of functions returning multiple values, and more,
-    from Jaakko J&auml;rvi.</li>
-    <li>type_traits -
-        Templates for fundamental properties of types, from John
-        Maddock, Steve Cleary, et al.</li>
-    <li>typeof -
-        Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
-    <li>uBLAS - Basic linear algebra
-    for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-    <li>units -
-        Zero-overhead dimensional analysis and unit/quantity
-        manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
-    <li>unordered - unordered associative containers, from Daniel James.</li>
-    <li>utility - Class <b>noncopyable</b>
-        plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
-      <b>prior()</b>
-        function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others.</li>
-    <li>value_initialized - Wrapper for uniform-syntax value initialization,
-    from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-    <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
-    <li>variant - Safe, generic, stack-based discriminated union
-    container, from Eric Friedman and Itay Maman.</li>
-    <li>wave -  Standards conformant
-  implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser </li>
-    <li>xpressive - Regular expressions that can be written as strings or as expression templates,
-        and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<hr>
-
-<h2>Libraries Listed by <a name="Category">Category</a></h2>
-
-<h3><a name="String">String</a> and text processing</h3>
-
-<ul>
-    <li>conversion/lexical_cast - <tt>lexical_cast</tt>
-      class template, from Kevlin Henney.</li>
-    <li>format - Type-safe 'printf-like' format
-    operations, from Samuel Krempp.</li>
-    <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
-    <li>locale - Provide localization and Unicode
-    handling tools for C++, from Artyom Beilis</li>
-    <li>regex - Regular expression
-        library, from John Maddock</li>
-    <li>spirit - LL parser framework&nbsp;
-    represents parsers directly as EBNF grammars in inlined C++, from Joel de
-    Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-    <li>string_algo -
-    String algorithms library, from Pavol Droba</li>
-    <li>tokenizer - Break of a string or other
-      character sequence into a series of tokens, from John Bandela</li>
-    <li>wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut&nbsp;Kaiser.</li>
-    <li>xpressive - Regular expressions that can be written as strings or as expression templates,
-        and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.</li>
-</ul>
-
-<h3><a name="Containers">Containers</a></h3>
-
-<ul>
-    <li>array - STL compliant
-        container wrapper for arrays of constant size, from
-        Nicolai Josuttis.</li>
-    <li>bimap - Bidirectional maps, from Matias Capeletto.
-        </li>
-    <li>circular_buffer - STL compliant
-        container also known as ring or cyclic buffer, from Jan Gaspar.</li>
-    <li>container - Standard library containers and extensions, from Ion Gazta&ntilde;aga</li>
-    <li>dynamic_bitset - A runtime sized version of <tt>std::bitset</tt> from Jeremy Siek and Chuck Allison.</li>
-    <li>gil - Generic Image Library, from
-         Lubomir Bourdev and Hailin Jin.</li>
-    <li>graph -
-        Generic graph components and algorithms, from Jeremy Siek
-        and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
-    <li>icl -
-        Interval Container Library, interval sets and maps and aggregation
-        of associated values, from Joachim Faulhaber.</li>
-    <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
-    <li>multi_array - Multidimensional
-    containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
-    <li>multi_index - Containers with
-    multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
-    Mu&ntilde;oz.</li>
-    <li>pointer container
-      - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
-    <li>property map
-        - Concepts defining interfaces which map key objects to
-        value objects, from Jeremy Siek.</li>
-    <li>property tree - A tree data
-        structure especially suited to storing configuration data, from Marcin
-        Kalicinski and Sebastian Redl.
-    <li>unordered - unordered associative containers, from Daniel James.</li>
-    <li>variant - Safe, generic, stack-based
-    discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Iterators">Iterators</a></h3>
-
-<ul>
-    <li>gil - Generic Image Library, from
-     Lubomir Bourdev and Hailin Jin.</li>
-    <li>graph -
-        Generic graph components and algorithms, from Jeremy Siek
-        and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
-    <li>iterators - Iterator
-        construction framework, adaptors, concepts, and more, from Dave
-        Abrahams, Jeremy Siek, and Thomas Witt.</li>
-    <li>operators - Templates
-        ease arithmetic classes and iterators, from Dave Abrahams
-        and Jeremy Siek.</li>
-    <li>tokenizer - Break of a string or other
-      character sequence into a series of tokens, from John Bandela.</li>
-</ul>
-
-<h3><a name="Algorithms">Algorithms</a></h3>
-
-<ul>
-    <li>foreach - BOOST_FOREACH macro for easily
-        iterating over the elements of a sequence, from Eric Niebler.</li>
-    <li>gil - Generic Image Library, from
-        Lubomir Bourdev and Hailin Jin.</li>
-    <li>geometry - Geometry Library, from
-        Barend Gehrels, Bruno Lalande and Mateusz Loskot.</li>
-    <li>graph -
-        Generic graph components and algorithms, from Jeremy Siek
-        and a University of Notre Dame team; now maintained by Andrew Sutton and Jeremiah Willcock.</li>
-    <li>minmax - standard library
-        extensions for simultaneous min/max and min/max element computations,
-        from Herv&eacute; Br&ouml;nnimann.</li>
-    <li>range - A new infrastructure
-        for generic algorithms that builds on top
-        of the new iterator concepts, from Thorsten Ottosen.</li>
-    <li>string_algo -
-        String algorithms library, from Pavol Droba</li>
-    <li>utility - Class <b>next(),</b>&nbsp; <b>prior()</b>
-      function templates, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Function-objects">Function objects</a> and higher-order programming</h3>
-
-<ul>
-    <li>bind and  mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.</li>
-
-    <li>function - Function object wrappers
-      for deferred calls or callbacks, from Doug Gregor.</li>
-    <li>functional - Enhanced
-        function object adaptors, from Mark Rodgers.</li>
-    <li>functional/factory -
-        function object templates for dynamic and static object creation,
-        from Tobias Schwinger</li>
-    <li>functional/forward -
-        adapters to allow generic function objects to accept arbitrary
-        arguments, from Tobias Schwinger</li>
-    <li>functional/hash -
-        A TR1 hash function object that can be extended to hash user defined
-        types, from Daniel James.</li>
-    <li>lambda - Define small unnamed
-    function objects at the actual call site, and more, from Jaakko J&auml;rvi and
-    Gary Powell.</li>
-    <li>Phoenix - Define small unnamed
-    function objects at the actual call site, and more, from Joel de Guzman, Dan
-    Marsden and Thomas Heller</li>
-    <li>ref - A utility library for
-    passing references to generic functions, from Jaako J&auml;rvi,
-    Peter Dimov, Doug Gregor, and Dave Abrahams.</li>
-
-    <li>signals - managed signals &amp;
-         slots callback implementation, from Doug Gregor.</li>
-    <li>signals2 - managed signals &amp;
-         slots callback implementation (thread-safe version 2), from Frank Mori Hess.</li>
-
-    <li>result_of - determines the type of a function call expression.</li>
-</ul>
-
-<h3><a name="Generic">Generic</a> Programming</h3>
-
-<ul>
-    <li>call_traits -
-        Defines types for passing parameters, from John Maddock,
-        Howard Hinnant, et al.</li>
-    <li>concept check
-        - Tools for generic programming, from Jeremy Siek.</li>
-    <li>enable_if -
-    Selective inclusion of function template overloads, from Jaakko
-    J&auml;rvi, Jeremiah Willcock, and Andrew Lumsdaine.</li>
-    <li>function_types - Type traits
-        for callable, built-in types, from Tobias Schwinger</li>
-    <li>gil - Generic Image Library, from
-        Lubomir Bourdev and Hailin Jin.</li>
-    <li>in_place_factory, typed_in_place_factory- Generic in-place construction
-         of contained objects with a variadic argument-list, from Fernando Cacciola.</li>
-    <li>operators - Templates
-        ease arithmetic classes and iterators, from Dave Abrahams
-        and Jeremy Siek.</li>
-
-    <li>property map
-        - Concepts defining interfaces which map key objects to
-        value objects, from Jeremy Siek.</li>
-    <li>static_assert
-        - Static assertions (compile time assertions), from John
-        Maddock.</li>
-    <li>type_traits -
-        Templates for fundamental properties of types, from John
-        Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3>Template <a name="Metaprogramming"> Metaprogramming</a></h3>
-
-<ul>
-    <li>function_types - Type traits
-        for callable, built-in types, from Tobias Schwinger</li>
-    <li>fusion -
-        Library for working with tuples, including various containers,
-    algorithms, etc. From Joel de Guzman, Dan Marsden and Tobias Schwinger.</li>
-    <li>mpl - Template metaprogramming
-    framework of compile-time algorithms, sequences and metafunction classes,
-    from Aleksey Gurtovoy.</li>
-    <li>proto - Expression template library and compiler
-        construction toolkit for domain-specific embedded languages, from Eric Niebler.</li>
-    <li>static_assert
-        - Static assertions (compile time assertions), from John
-        Maddock.</li>
-    <li>type_traits -
-        Templates for fundamental properties of types, from John
-        Maddock, Steve Cleary, et al.</li>
-</ul>
-
-<h3><a name="Preprocessor">Preprocessor</a> Metaprogramming</h3>
-
-<ul>
-    <li>preprocessor - Preprocessor
-    metaprogramming tools including repetition and recursion, from Vesa Karvonen
-    and Paul Mensonides.</li>
-</ul>
-
-<h3><a name="Concurrent">Concurrent</a> Programming</h3>
-
-<ul>
-    <li>asio - Portable networking and other low-level
-        I/O, including sockets, timers, hostname resolution, socket iostreams, serial
-        ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
-    <li>interprocess - Shared memory, memory mapped files,
-    process-shared mutexes, condition variables, containers and allocators, from Ion Gazta&ntilde;aga</li>
-    <li>MPI - Message Passing Interface library, for use in distributed-memory parallel application programming, from Douglas Gregor and Matthias Troyer.</li>
-    <li>thread - Portable C++
-      multi-threading, from William Kempf.</li>
-</ul>
-
-<h3><a name="Math">Math</a> and numerics</h3>
-
-<ul>
-    <li>accumulators - Framework for incremental
-        calculation, and collection of statistical accumulators, from Eric Niebler.</li>
-    <li>geometry - Geometry Library, from
-        Barend Gehrels, Bruno Lalande and Mateusz Loskot.</li>
-    <li>integer - Headers to ease
-        dealing with integral types.</li>
-    <li>interval - Extends the
-    usual arithmetic functions to mathematical intervals, from Guillaume
-    Melquiond, Herv&eacute; Br&ouml;nnimann and Sylvain Pion.</li>
-    <li>math - Several contributions in the
-    domain of mathematics, from various authors.</li>
-    <li>math/complex number algorithms -
-    These complex number algorithms are the inverses of trigonometric functions currently present in the C++ standard, from John Maddock.</li>
-    <li>math/common_factor - Greatest
-    common divisor and least common multiple, from Daryle Walker.</li>
-    <li>math/octonion -
-        Octonions, from Hubert Holin.</li>
-    <li>math/quaternion -
-        Quaternions, from Hubert Holin.</li>
-    <li>math/special_functions -
-        A wide selection of mathematical special functions from John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang.</li>
-    <li>math/statistical distributions -
-        A wide selection of univariate statistical distributions and functions that operate on them from John Maddock and Paul Bristow</li>
-    <li>multi_array - Multidimensional
-    containers and adaptors for arrays of contiguous data, from Ron Garcia.</li>
-    <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
-        from Fernando  </li>
-    <li>operators - Templates
-        ease arithmetic classes and iterators, from Dave Abrahams
-        and Jeremy Siek.</li>
-    <li>random - A complete
-        system for random number generation, from Jens Maurer.</li>
-    <li>ratio - A compile time ratio arithmetic,
-        from Howard Hinnant, Beman Dawes, Vicente J. Botet Escrib&aacute;.</li>
-    <li>rational - A rational
-        number class, from Paul Moore.</li>
-    <li>uBLAS - Basic linear algebra
-    for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.</li>
-</ul>
-
-<h3><a name="Correctness">Correctness</a> and testing</h3>
-
-<ul>
-    <li>concept check
-        - Tools for generic programming, from Jeremy Siek.</li>
-    <li>static_assert
-        - Static assertions (compile time assertions), from John
-        Maddock.</li>
-    <li>test - Support for simple program testing,
-    full unit testing, and for program
-      execution monitoring, from Gennadiy Rozental.</li>
-</ul>
-
-<h3><a name="Data">Data</a> structures</h3>
-
-<ul>
-    <li>any - Safe, generic container for single
-      values of different value types, from Kevlin Henney.</li>
-    <li>bimap - Bidirectional maps, from Matias Capeletto.
-        </li>
-    <li>container - Standard library containers and extensions, from Ion Gazta&ntilde;aga</li>
-    <li>compressed_pair
-        - Empty member optimization, from John Maddock, Howard
-        Hinnant, et al.</li>
-    <li>fusion -
-        Library for working with tuples, including various containers, algorithms, etc.
-        From Joel de Guzman and Dan Marsden and Tobias Schwinger.</li>
-    <li>icl -
-        Interval Container Library, interval sets and maps and aggregation
-        of associated values, from Joachim Faulhaber.</li>
-    <li>intrusive - Intrusive containers and algorithms, from Ion Gazta&ntilde;aga</li>
-    <li>multi_index - Containers with
-    multiple STL-compatible access interfaces, from Joaqu&iacute;n M L&oacute;pez
-    Mu&ntilde;oz.</li>
-    <li>pointer container
-    - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen. </li>
-    <li>property tree - A tree data
-        structure especially suited to storing configuration data, from Marcin
-        Kalicinski and Sebastian Redl.
-    <li>tuple - Ease definition of functions returning multiple values, and more,
-    from Jaakko J&auml;rvi.</li>
-    <li>uuid - A universally unique identifier, from Andy Tompkins.</li>
-    <li>variant - Safe, generic, stack-based
-    discriminated union container, from Eric Friedman and Itay Maman.</li>
-</ul>
-
-<h3><a name="Image-processing">Image processing</a></h3>
-<ul>
-  <li>gil - Generic Image Library, from
-  Lubomir Bourdev and Hailin Jin.</li>
-</ul>
-
-<h3><a name="IO">Input/Output</a></h3>
-<ul>
-    <li>asio - Portable networking and other low-level
-        I/O, including sockets, timers, hostname resolution, socket iostreams, serial
-        ports, file descriptors and Windows HANDLEs, from Chris Kohlhoff.</li>
-    <li>assign - Filling containers
-    with constant or generated data has never been
-    easier, from Thorsten Ottosen.
-    </li>
-
-  <li>format - Type-safe 'printf-like' format
-  operations, from Samuel Krempp.</li>
-  <li>io state savers - Save I/O state to
-  prevent jumbled data, from Daryle Walker.</li>
-  <li>iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.</li>
-  <li>program_options - Access to configuration
-  data given on command line, in config files and other sources, from Vladimir Prus.</li>
-  <li>serialization - Serialization
-of arbitrary data for persistence and marshalling, from Robert Ramey</li>
-
-</ul>
-
-<h3><a name="Inter-language">Inter-language</a> support</h3>
-
-<ul>
-    <li>python - Reflects C++
-        classes and functions into <a
-        href="http://www.python.org">Python</a>, from Dave
-        Abrahams.</li>
-</ul>
-
-<h3><a name="Memory">Memory</a></h3>
-
-<ul>
-    <li>pool - Memory pool management, from
-      Steve Cleary.</li>
-    <li>smart_ptr - Six smart
-        pointer class templates, from Greg Colvin, Beman Dawes,
-        Peter Dimov, and Darin Adler.</li>
-    <li>utility - Class <b>noncopyable</b>
-        plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
-      <b>prior()</b>
-        function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-</ul>
-
-<h3><a name="Parsing">Parsing</a></h3>
-
-<ul>
-    <li>spirit - LL parser framework&nbsp;
-    represents parsers directly as EBNF grammars in inlined C++, from Joel de
-    Guzman, Hartmut Kaiser, Dan Nuffer and team.</li>
-</ul>
-
-<h3><a name="Programming">Programming Interfaces</a></h3>
-
-<ul>
-    <li>function - Function object wrappers
-      for deferred calls or callbacks, from Doug Gregor.</li>
-
-    <li><span class="library"><a href=
-    "parameter/doc/html/index.html">parameter</a></span> -
-    Write functions that accept arguments by name, by David Abrahams
-    and Daniel Wallin.</li>
-</ul>
-
-<h3><a name="Miscellaneous">Miscellaneous</a></h3>
-
-<ul>
-    <li>base-from-member - Idiom to
-    initialize a base class with a member, from Daryle Walker.</li>
-    <li>chrono - Useful time utilities,
-        from Howard Hinnant, Beman Dawes, Vicente J. Botet Escrib&aacute;.</li>
-    <li>compressed_pair
-        - Empty member optimization, from John Maddock, Howard
-        Hinnant, et al.</li>
-    <li>conversion - Polymorphic and lexical casts, from Dave Abrahams and
-        Kevlin Henney.</li>
-    <li>crc - Cyclic Redundancy Code, from Daryle
-      Walker.</li>
-    <li>date_time - Date-Time library from Jeff Garland.</li>
-    <li>exception - A library for transporting of arbitrary data in exception objects, and transporting of exceptions between threads (N2179), from Emil Dotchevski.</li>
-    <li>filesystem - Portable paths,
-    iteration over directories, and other useful filesystem operations, from
-    Beman Dawes.</li>
-    <li>flyweight - Design pattern
-    to manage large quantities of highly redundant objects,
-    from Joaqu&iacute;n M L&oacute;pez Mu&ntilde;oz.</li>
-    <li>lexical_cast -&nbsp; General literal text conversions, such as an <code>int</code> represented as
-    a <code>string</code>, or vice-versa, from Kevlin Henney.</li>
-    <li>meta state machine - High-performance expressive UML 2.0 finite state machines, from Christophe Henry.</li>
-    <li>move - Portable move semantics for C++03 and C++1 compilers, from Ion Gazta&ntilde;aga</li>
-    <li>numeric/conversion - Optimized Policy-based Numeric Conversions,
-        from Fernando Cacciola.</li>
-    <li>optional - Discriminated-union
-    wrapper for optional values, from Fernando Cacciola.</li>
-    <li>program_options - Access to configuration
-        data given on command line, in config files and other sources, from Vladimir Prus.</li>
-    <li>scope_exit
-        - Execute arbitrary code at scope exit, from Alexander Nasonov.</li>
-    <li>statechart - Arbitrarily
-    complex finite state machines can be implemented in easily readable and
-    maintainable C++ code, from Andreas Huber.</li>
-    <li>swap -
-    Enhanced generic swap function, from Joseph Gauterin.</li>
-    <li>system - Operating
-    system support, including the diagnostics support that will be part of the
-    C++0x standard library, from Beman Dawes.</li>
-    <li>timer - Event timer,
-    progress timer, and progress display classes, from Beman
-    Dawes.</li>
-    <li>TR1 - An implementation of the Technical
-        Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.</li>
-    <li>tribool - 3-state boolean type library, from Doug Gregor.</li>
-    <li>typeof -
-        Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.</li>
-    <li>units -
-        Zero-overhead dimensional analysis and unit/quantity
-        manipulation and conversion, from Matthias Schabel and Steven Watanabe.</li>
-    <li>utility - Class <b>noncopyable</b>
-        plus <b>checked_delete()</b>, <b>checked_array_delete()</b>, <b>next(),</b>&nbsp;
-      <b>prior()</b>
-        function templates, plus <b>base-from-member idiom</b>, from Dave Abrahams and others. </li>
-    <li>value_initialized - Wrapper for uniform-syntax value initialization,
-    from Fernando Cacciola, based on the original idea of David Abrahams.</li>
-</ul>
-
-<h3>Broken compiler <a name="workarounds">workarounds</a></h3>
-
-<ul>
-    <li>compatibility - Help for
-      non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens
-      Maurer.</li>
-    <li>config - Helps boost
-        library developers adapt to compiler idiosyncrasies; not
-        intended for library users.</li>
-</ul>
-
-<p>[Category suggestions from Aleksey Gurtovoy and Beman Dawes]</p>
-
-<hr>
-
-<h2>Libraries <a name="Removed">Retired</a> from Boost</h2>
-
-<ul>
-    <li>compose - Functional composition adapters for the STL,
-        from Nicolai Josuttis.  Removed in Boost version 1.32.
-        Please use Bind or <a
-        href="lambda/index.html">Lambda</a> instead.</li>
-</ul>
-
-<hr>
-
-<p>Revised
-<!--webbot bot="Timestamp" s-type="EDITED"
-s-format="%d %b %Y" startspan -->03 Nov 2009<!--webbot bot="Timestamp" endspan i-checksum="15274" --></p>
-
-<p>&copy; Copyright Beman Dawes 2000-2004</p>
-<p>Distributed under the Boost Software License, Version 1.0.
-(See file LICENSE_1_0.txt
-or www.boost.org/LICENSE_1_0.txt)
-</p>
-
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_48_0/libs/timer/index.html
==============================================================================
--- website/public_html/beta/doc/libs/1_48_0/libs/timer/index.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,14 +0,0 @@
-<html>
-<head>
-<meta http-equiv="refresh" content="0; URL=doc/index.html">
-</head>
-<body>
-Automatic redirection failed, please go to doc/index.html.
-<hr>
-<p>&copy; Copyright Beman Dawes, 2003, 2011</p>
-<p> Distributed under the Boost Software 
-License, Version 1.0.</p>
-<p> See <a href="http://www.boost.org/LICENSE_1_0.txt">
-www.boost.org/LICENSE_1_0.txt</a></p>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/add2.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/add2_call.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/adder.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/alert.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/banner.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/fbox.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/funnel_in.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/funnel_out.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/home.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/important.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/lambda_cpp.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/next.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/note.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/organization.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/organization_alt.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/prev.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/simple_ast.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/smiley.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/tip.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/images/up.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/index.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/index.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,306 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Chapter&#160;1.&#160;Phoenix 3.0</title>
-<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="next" href="phoenix/what_s_new.html" title="What's New">
-</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="phoenix/what_s_new.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
-<div class="chapter">
-<div class="titlepage"><div>
-<div><h2 class="title">
-<a name="phoenix"></a>Chapter&#160;1.&#160;Phoenix 3.0</h2></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Joel</span> <span class="surname">de Guzman</span>
-</h3></div></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Dan</span> <span class="surname">Marsden</span>
-</h3></div></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Thomas</span> <span class="surname">Heller</span>
-</h3></div></div>
-<div><p class="copyright">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller</p></div>
-<div><div class="legalnotice">
-<a name="phoenix.legal"></a><p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></div>
-</div></div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="section">What's New</span></dt>
-<dd><dl><dt><span class="section">Phoenix 3.0</span></dt></dl></dd>
-<dt><span class="section">Introduction</span></dt>
-<dt><span class="section">Starter Kit</span></dt>
-<dd><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Lazy Operators</span></dt>
-<dt><span class="section">Lazy Statements</span></dt>
-<dt><span class="section"><a href="phoenix/starter_kit/construct__new__delete__casts.html">Construct,
-      New, Delete, Casts</a></span></dt>
-<dt><span class="section">Lazy Functions</span></dt>
-<dt><span class="section">More</span></dt>
-</dl></dd>
-<dt><span class="section">Basics</span></dt>
-<dt><span class="section">Organization</span></dt>
-<dt><span class="section">Actor</span></dt>
-<dt><span class="section">Modules</span></dt>
-<dd><dl>
-<dt><span class="section">Core</span></dt>
-<dd><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Nothing</span></dt>
-</dl></dd>
-<dt><span class="section">Function</span></dt>
-<dd><dl><dt><span class="section"><a href="phoenix/modules/function/adapting_functions.html">Adapting
-        Functions</a></span></dt></dl></dd>
-<dt><span class="section">Operator</span></dt>
-<dt><span class="section">Statement</span></dt>
-<dd><dl>
-<dt><span class="section">Block Statement</span></dt>
-<dt><span class="section">if_ Statement</span></dt>
-<dt><span class="section">if_else_ Statement</span></dt>
-<dt><span class="section"><a href="phoenix/modules/statement/switch__statement.html">switch_
-        Statement</a></span></dt>
-<dt><span class="section"><a href="phoenix/modules/statement/while__statement.html">while_
-        Statement</a></span></dt>
-<dt><span class="section">do_while_ Statement</span></dt>
-<dt><span class="section">for_ Statement</span></dt>
-<dt><span class="section"><a href="phoenix/modules/statement/try__catch__statement.html">try_
-        catch_ Statement</a></span></dt>
-<dt><span class="section">throw_</span></dt>
-</dl></dd>
-<dt><span class="section">Object</span></dt>
-<dd><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section">New</span></dt>
-<dt><span class="section">Delete</span></dt>
-<dt><span class="section">Casts</span></dt>
-</dl></dd>
-<dt><span class="section">Scope</span></dt>
-<dd><dl>
-<dt><span class="section">Local Variables</span></dt>
-<dt><span class="section">let</span></dt>
-<dt><span class="section">lambda</span></dt>
-</dl></dd>
-<dt><span class="section">Bind</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="phoenix/modules/bind/binding_function_objects.html">Binding
-        Function Objects</a></span></dt>
-<dt><span class="section">Binding Functions</span></dt>
-<dt><span class="section"><a href="phoenix/modules/bind/binding_member_functions.html">Binding
-        Member Functions</a></span></dt>
-<dt><span class="section"><a href="phoenix/modules/bind/binding_member_variables.html">Binding
-        Member Variables</a></span></dt>
-<dt><span class="section"><a href="phoenix/modules/bind/compatibility_with_boost_bind.html">Compatibility
-        with Boost.Bind</a></span></dt>
-</dl></dd>
-<dt><span class="section">STL</span></dt>
-<dd><dl>
-<dt><span class="section">Container</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-</dl></dd>
-</dl></dd>
-<dt><span class="section">Inside Phoenix</span></dt>
-<dd><dl>
-<dt><span class="section">Actors in Detail</span></dt>
-<dt><span class="section">Phoenix Expressions</span></dt>
-<dd><dl><dt><span class="section"><a href="phoenix/inside/expression/boilerplate_macros.html">Boilerplate
-        Macros</a></span></dt></dl></dd>
-<dt><span class="section">More on Actions</span></dt>
-<dt><span class="section">Predefined Expressions and Rules</span></dt>
-<dt><span class="section">Custom Terminals</span></dt>
-<dt><span class="section">Placeholder Unification</span></dt>
-</dl></dd>
-<dt><span class="section">Advanced Examples</span></dt>
-<dd><dl>
-<dt><span class="section">Extending Actors</span></dt>
-<dt><span class="section">Adding an expression</span></dt>
-<dt><span class="section"><a href="phoenix/examples/transforming_the_expression_tree.html">Transforming
-      the Expression Tree</a></span></dt>
-</dl></dd>
-<dt><span class="section">Wrap Up</span></dt>
-<dt><span class="section">Acknowledgments</span></dt>
-<dt><span class="section">References</span></dt>
-</dl>
-</div>
-<h2>
-<a name="phoenix.h0"></a>
-    <span><a name="phoenix.preface"></a></span><a class="link" href="index.html#phoenix.preface">Preface</a>
-  </h2>
-<div class="blockquote"><blockquote class="blockquote"><p>
-      <span class="emphasis"><em>Functional programming is so called because a program consists entirely
-      of functions. The main program itself is written as a function which receives
-      the program's input as its argument and delivers the program's output as its
-      result. Typically the main function is defined in terms of other functions,
-      which in turn are defined in terms of still more functions until at the bottom
-      level the functions are language primitives.</em></span>
-    </p></blockquote></div>
-<div class="blockquote"><blockquote class="blockquote"><p>
-      <span class="bold"><strong>John Hughes</strong></span>-- <span class="emphasis"><em>Why Functional Programming
-      Matters</em></span>
-    </p></blockquote></div>
-<p>
-    <span class="inlinemediaobject"><img src="images/lambda_cpp.png" alt="lambda_cpp"></span>
-  </p>
-<h3>
-<a name="phoenix.h1"></a>
-    <span><a name="phoenix.description"></a></span><a class="link" href="index.html#phoenix.description">Description</a>
-  </h3>
-<p>
-    Phoenix enables Functional Programming (FP) in C++. The design and implementation
-    of Phoenix is highly influenced by FC++
-    by Yannis Smaragdakis and Brian McNamara and the BLL
-    (Boost Lambda Library) by Jaakko Jaarvi and Gary Powell. Phoenix is a blend of
-    FC++ and BLL using the implementation techniques used in the Spirit
-    inline parser.
-  </p>
-<p>
-    Phoenix is a header only library. It is extremely modular by design. One can
-    extract and use only a small subset of the full library, literally tearing the
-    library into small pieces, without fear that the pieces won't work anymore. The
-    library is organized in highly independent modules and layers.
-  </p>
-<h3>
-<a name="phoenix.h2"></a>
-    <span><a name="phoenix.how_to_use_this_manual"></a></span><a class="link" href="index.html#phoenix.how_to_use_this_manual">How
-    to use this manual</a>
-  </h3>
-<p>
-    The Phoenix library is organized in logical modules. This documentation provides
-    a user's guide and reference for each module in the library. A simple and clear
-    code example is worth a hundred lines of documentation; therefore, the user's
-    guide is presented with abundant examples annotated and explained in step-wise
-    manner. The user's guide is based on examples: lots of them.
-  </p>
-<p>
-    As much as possible, forward information (i.e. citing a specific piece of information
-    that has not yet been discussed) is avoided in the user's manual portion of each
-    module. In many cases, though, it is unavoidable that advanced but related topics
-    not be interspersed with the normal flow of discussion. To alleviate this problem,
-    topics categorized as "advanced" may be skipped at first reading.
-  </p>
-<p>
-    Some icons are used to mark certain topics indicative of their relevance. These
-    icons precede some text to indicate:
-  </p>
-<div class="table">
-<a name="phoenix.t0"></a><p class="title"><b>Table&#160;1.1.&#160;Icons</b></p>
-<div class="table-contents"><table class="table" summary="Icons">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-            <p>
-              Icon
-            </p>
-          </th>
-<th>
-            <p>
-              Name
-            </p>
-          </th>
-<th>
-            <p>
-              Meaning
-            </p>
-          </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-            <p>
-              <span class="inlinemediaobject"><img src="images/note.png" alt="note"></span>
-            </p>
-          </td>
-<td>
-            <p>
-              Note
-            </p>
-          </td>
-<td>
-            <p>
-              Information provided is auxiliary but will give the reader a deeper
-              insight into a specific topic. May be skipped.
-            </p>
-          </td>
-</tr>
-<tr>
-<td>
-            <p>
-              <span class="inlinemediaobject"><img src="images/alert.png" alt="alert"></span>
-            </p>
-          </td>
-<td>
-            <p>
-              Alert
-            </p>
-          </td>
-<td>
-            <p>
-              Information provided is of utmost importance.
-            </p>
-          </td>
-</tr>
-<tr>
-<td>
-            <p>
-              <span class="inlinemediaobject"><img src="images/tip.png" alt="tip"></span>
-            </p>
-          </td>
-<td>
-            <p>
-              Tip
-            </p>
-          </td>
-<td>
-            <p>
-              A potentially useful and helpful piece of information.
-            </p>
-          </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="sidebar">
-<div class="titlepage"></div>
-<p>
-    <span class="inlinemediaobject"><img src="images/note.png" alt="note"></span> Unless otherwise noted <code class="computeroutput"><span class="keyword">using</span>
-    <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">;</span></code>
-    is assumed
-  </p>
-</div>
-<h3>
-<a name="phoenix.h3"></a>
-    <span><a name="phoenix._emphasis_role__bold___emphasis____to_joel_s_dear_daughter__phoenix__emphasis___emphasis_"></a></span><a class="link" href="index.html#phoenix._emphasis_role__bold___emphasis____to_joel_s_dear_daughter__phoenix__emphasis___emphasis_"><span class="bold"><strong><span class="emphasis"><em>...To Joel's dear daughter, Phoenix</em></span></strong></span></a>
-  </h3>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: July 14, 2012 at 06:11:27 GMT</small></p></td>
-<td align="right"><div class="copyright-footer"></div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav"><a accesskey="n" href="phoenix/what_s_new.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/acknowledgments.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,94 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Acknowledgments</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="wrap_up.html" title="Wrap Up">
-<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="wrap_up.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.acknowledgments"></a><a class="link" href="acknowledgments.html" title="Acknowledgments">Acknowledgments</a>
-</h2></div></div></div>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Hartmut Kaiser implemented the original lazy casts and constructors based
-          on his original work on Spirit SE "semantic expressions" (the
-          precursor to Phoenix), and guided Phoenix from the initial review of V2
-          to the release of V3.
-        </li>
-<li class="listitem">
-          Eric Niebler did a 2.0 pre-release review and wrote some range related
-          code that Phoenix stole and used in the algorithms. Additionally he played
-          the leading role in inventing the extension mechanism as well as providing
-          early prototypes and helping with Boost.Proto code. DA Proto MAN!
-        </li>
-<li class="listitem">
-          Angus Leeming implemented the container functions on Phoenix-1 which I
-          then ported to Phoenix-2.
-        </li>
-<li class="listitem">
-          Daniel Wallin helped with the scope module, local variables, let and lambda
-          and the algorithms. I frequently discuss design issues with Daniel on Yahoo
-          Messenger.
-        </li>
-<li class="listitem">
-          Jaakko Jarvi. DA Lambda MAN!
-        </li>
-<li class="listitem">
-          Dave Abrahams, for his constant presence, wherever, whenever.
-        </li>
-<li class="listitem">
-          Aleksey Gurtovoy, DA MPL MAN!
-        </li>
-<li class="listitem">
-          Doug Gregor, always a source of inspiration.
-        </li>
-<li class="listitem">
-          Dan Marsden, did almost all the work in bringing Phoenix-2 out the door.
-        </li>
-<li class="listitem">
-          Thorsten Ottosen; Eric's range_ex code began life as "container_algo"
-          in the old boost sandbox, by Thorsten in 2002-2003.
-        </li>
-<li class="listitem">
-          Jeremy Siek, even prior to Thorsten, in 2001, started the "container_algo".
-        </li>
-<li class="listitem">
-          Vladimir Prus wrote the mutating algorithms code from the Boost Wiki.
-        </li>
-<li class="listitem">
-          Daryle Walker did a 2.0 pre-release review.
-        </li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="wrap_up.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/actor.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/actor.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,90 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Actor</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="organization.html" title="Organization">
-<link rel="next" href="modules.html" title="Modules">
-</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="organization.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.actor"></a><a class="link" href="actor.html" title="Actor">Actor</a>
-</h2></div></div></div>
-<p>
-      The <code class="computeroutput"><span class="identifier">Actor</span></code> is the main concept
-      behind the library. Actors are function objects. An actor can accept 0 to
-      <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code> arguments.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>,
-        the predefined maximum arity an actor can take. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code> is set to 10.
-      </p></td></tr>
-</table></div>
-<p>
-      Phoenix supplies an <code class="computeroutput"><span class="identifier">actor</span></code> class
-      template whose specializations model the <code class="computeroutput"><span class="identifier">Actor</span></code>
-      concept. <code class="computeroutput"><span class="identifier">actor</span></code> has one template
-      parameter, <code class="computeroutput"><span class="identifier">Expr</span></code>, that supplies
-      the underlying expression to evaluate.
-    </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">actor</span>
-<span class="special">{</span>
-    <span class="identifier">return_type</span>
-    <span class="keyword">operator</span><span class="special">()()</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">&gt;</span>
-    <span class="identifier">return_type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">&gt;</span>
-    <span class="identifier">return_type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">&amp;</span> <span class="identifier">_1</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="comment">//...</span>
-<span class="special">};</span>
-</pre>
-<p>
-      The actor class accepts the arguments through a set of function call operators
-      for 0 to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-      arities (Don't worry about the details, for now. Note, for example, that we
-      skimp over the details regarding <code class="computeroutput"><span class="identifier">return_type</span></code>).
-      The arguments are passed through to the evaluation mechanism. For more information
-      see <a class="link" href="inside/actor.html" title="Actors in Detail">Inside Actors</a>.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="organization.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/basics.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/basics.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,273 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Basics</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="starter_kit/more.html" title="More">
-<link rel="next" href="organization.html" title="Organization">
-</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="starter_kit/more.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.basics"></a><a class="link" href="basics.html" title="Basics">Basics</a>
-</h2></div></div></div>
-<p>
-      Almost everything is a function in the Phoenix library that can be evaluated
-      as <code class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="identifier">a1</span><span class="special">,</span> <span class="identifier">a2</span><span class="special">,</span> <span class="special">...,</span> a/n/<span class="special">)</span></code>, where <span class="emphasis"><em>n</em></span> is the function's
-      arity, or number of arguments that the function expects. Operators are also
-      functions. For example, <code class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></code> is just
-      a function with arity == 2 (or binary). <code class="computeroutput"><span class="identifier">a</span>
-      <span class="special">+</span> <span class="identifier">b</span></code>
-      is the same as <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">a</span>
-      <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="identifier">c</span></code> is the
-      same as <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">),</span>
-      <span class="identifier">c</span><span class="special">)</span></code>.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        Amusingly, functions may even return functions. We shall see what this means
-        in a short while.
-      </p></td></tr>
-</table></div>
-<h4>
-<a name="phoenix.basics.h0"></a>
-      <span><a name="phoenix.basics.partial_function_application"></a></span><a class="link" href="basics.html#phoenix.basics.partial_function_application">Partial
-      Function Application</a>
-    </h4>
-<p>
-      Think of a function as a black box. You pass arguments and it returns something
-      back. The figure below depicts the typical scenario.
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/fbox.png" alt="fbox"></span>
-    </p>
-<p>
-      A fully evaluated function is one in which all the arguments are given. All
-      functions in plain C++ are fully evaluated. When you call the <code class="computeroutput"><span class="identifier">sin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> function, you have to pass a number x. The
-      function will return a result in return: the sin of x. When you call the <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">)</span></code>
-      function, you have to pass two numbers x and y. The function will return the
-      sum of the two numbers. The figure below is a fully evaluated <code class="computeroutput"><span class="identifier">add</span></code> function.
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/adder.png" alt="adder"></span>
-    </p>
-<p>
-      A partially applied function, on the other hand, is one in which not all the
-      arguments are supplied. If we are able to partially apply the function <code class="computeroutput"><span class="identifier">add</span></code> above, we may pass only the first argument.
-      In doing so, the function does not have all the required information it needs
-      to perform its task to compute and return a result. What it returns instead
-      is another function, a lambda function. Unlike the original <code class="computeroutput"><span class="identifier">add</span></code>
-      function which has an arity of 2, the resulting lambda function has an arity
-      of 1. Why? because we already supplied part of the input: <code class="computeroutput"><span class="number">2</span></code>
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/add2.png" alt="add2"></span>
-    </p>
-<p>
-      Now, when we shove in a number into our lambda function, it will return 2 plus
-      whatever we pass in. The lambda function essentially remembers 1) the original
-      function, <code class="computeroutput"><span class="identifier">add</span></code>, and 2) the partial
-      input, 2. The figure below illustrates a case where we pass 3 to our lambda
-      function, which then returns 5:
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/add2_call.png" alt="add2_call"></span>
-    </p>
-<p>
-      Obviously, partially applying the <code class="computeroutput"><span class="identifier">add</span></code>
-      function, as we see above, cannot be done directly in C++ where we are expected
-      to supply all the arguments that a function expects. That's where the Phoenix
-      library comes in. The library provides the facilities to do partial function
-      application. And even more, with Phoenix, these resulting functions won't be
-      black boxes anymore.
-    </p>
-<h4>
-<a name="phoenix.basics.h1"></a>
-      <span><a name="phoenix.basics.stl_and_higher_order_functions"></a></span><a class="link" href="basics.html#phoenix.basics.stl_and_higher_order_functions">STL
-      and higher order functions</a>
-    </h4>
-<p>
-      So, what's all the fuss? What makes partial function application so useful?
-      Recall our original example in the <a class="link" href="starter_kit/lazy_operators.html" title="Lazy Operators">previous
-      section</a>:
-    </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-</pre>
-<p>
-      The expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
-      <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> evaluates to a lambda function. <code class="computeroutput"><span class="identifier">arg1</span></code> is a placeholder for an argument to
-      be supplied later. Hence, since there's only one unsupplied argument, the lambda
-      function has an arity 1. It just so happens that <code class="computeroutput"><span class="identifier">find_if</span></code>
-      supplies the unsupplied argument as it loops from <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-      to <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        Higher order functions are functions which can take other functions as arguments,
-        and may also return functions as results. Higher order functions are functions
-        that are treated like any other objects and can be used as arguments and
-        return values from functions.
-      </p></td></tr>
-</table></div>
-<h4>
-<a name="phoenix.basics.h2"></a>
-      <span><a name="phoenix.basics.lazy_evaluation"></a></span><a class="link" href="basics.html#phoenix.basics.lazy_evaluation">Lazy
-      Evaluation</a>
-    </h4>
-<p>
-      In Phoenix, to put it more accurately, function evaluation has two stages:
-    </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Partial application
-        </li>
-<li class="listitem">
-          Final evaluation
-        </li>
-</ol></div>
-<p>
-      The first stage is handled by a set of generator functions. These are your
-      front ends (in the client's perspective). These generators create (through
-      partial function application), higher order functions that can be passed on
-      just like any other function pointer or function object. The second stage,
-      the actual function call, can be invoked or executed anytime in the future,
-      or not at all; hence <span class="emphasis"><em>"lazy"</em></span>.
-    </p>
-<p>
-      If we look more closely, the first step involves partial function application:
-    </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span>
-</pre>
-<p>
-      The second step is the actual function invocation (done inside the <code class="computeroutput"><span class="identifier">find_if</span></code> function. These are the back-ends
-      (often, the final invocation is never actually seen by the client). In our
-      example, the <code class="computeroutput"><span class="identifier">find_if</span></code>, if we
-      take a look inside, we'll see something like:
-    </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Predicate</span><span class="special">&gt;</span>
-<span class="identifier">InputIterator</span>
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">pred</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">while</span> <span class="special">(</span><span class="identifier">first</span> <span class="special">!=</span> <span class="identifier">last</span> <span class="special">&amp;&amp;</span> <span class="special">!</span><span class="identifier">pred</span><span class="special">(*</span><span class="identifier">first</span><span class="special">))</span>  <span class="comment">// &lt;--- The lambda function is called here</span>
-        <span class="special">++</span><span class="identifier">first</span><span class="special">;</span>                            <span class="comment">//      passing in *first</span>
-    <span class="keyword">return</span> <span class="identifier">first</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-      Again, typically, we, as clients, see only the first step. However, in this
-      document and in the examples and tests provided, don't be surprised to see
-      the first and second steps juxtaposed in order to illustrate the complete semantics
-      of Phoenix expressions. Examples:
-    </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">x</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
-<span class="keyword">int</span> <span class="identifier">y</span> <span class="special">=</span> <span class="number">2</span><span class="special">;</span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 1 or true</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">y</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 0 or false</span>
-</pre>
-<h4>
-<a name="phoenix.basics.h3"></a>
-      <span><a name="phoenix.basics.forwarding_function_problem"></a></span><a class="link" href="basics.html#phoenix.basics.forwarding_function_problem">Forwarding
-      Function Problem</a>
-    </h4>
-<p>
-      Usually, we, as clients, write the call-back functions while libraries (such
-      as STL) provide the callee (e.g. <code class="computeroutput"><span class="identifier">find_if</span></code>).
-      In case the role is reversed, e.g. if you have to write an STL algorithm that
-      takes in a predicate, or develop a GUI library that accepts event handlers,
-      you have to be aware of a little known problem in C++ called the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
-      Function Problem</a>".
-    </p>
-<p>
-      Look again at the code above:
-    </p>
-<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span>
-</pre>
-<p>
-      Notice that, in the second-stage (the final evaluation), we used a variable
-      <code class="computeroutput"><span class="identifier">x</span></code>.
-    </p>
-<p>
-      In Phoenix we emulated perfect forwarding through preprocessor macros generating
-      code to allow const and non-const references.
-    </p>
-<p>
-      We generate these second-stage overloads for Phoenix expression up to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARD_LIMIT</span></code>
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARD_LIMIT</span></code>,
-        the predefined maximum perfect forward arguments an actor can take. By default,
-        <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARDLIMIT</span></code>
-        is set to 3.
-      </p></td></tr>
-</table></div>
-<h4>
-<a name="phoenix.basics.h4"></a>
-      <span><a name="phoenix.basics.polymorphic_functions"></a></span><a class="link" href="basics.html#phoenix.basics.polymorphic_functions">Polymorphic
-      Functions</a>
-    </h4>
-<p>
-      Unless otherwise noted, Phoenix generated functions are fully polymorphic.
-      For instance, the <code class="computeroutput"><span class="identifier">add</span></code> example
-      above can apply to integers, floating points, user defined complex numbers
-      or even strings. Example:
-    </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">h</span><span class="special">(</span><span class="string">"Hello"</span><span class="special">);</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">w</span> <span class="special">=</span> <span class="string">" World"</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">h</span><span class="special">,</span> <span class="identifier">w</span><span class="special">);</span>
-</pre>
-<p>
-      evaluates to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">(</span><span class="string">"Hello
-      World"</span><span class="special">)</span></code>. The observant
-      reader might notice that this function call in fact takes in heterogeneous
-      arguments where <code class="computeroutput"><span class="identifier">arg1</span></code> is of
-      type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> and <code class="computeroutput"><span class="identifier">arg2</span></code>
-      is of type <code class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span></code>. <code class="computeroutput"><span class="identifier">add</span></code>
-      still works because the C++ standard library allows the expression <code class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></code>
-      where <code class="computeroutput"><span class="identifier">a</span></code> is a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code>
-      and <code class="computeroutput"><span class="identifier">b</span></code> is a <code class="computeroutput"><span class="keyword">char</span>
-      <span class="keyword">const</span><span class="special">*</span></code>.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="starter_kit/more.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,49 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Advanced Examples</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="inside/placeholder_unification.html" title="Placeholder Unification">
-<link rel="next" href="examples/extending_actors.html" title="Extending Actors">
-</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="inside/placeholder_unification.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/extending_actors.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.examples"></a><a class="link" href="examples.html" title="Advanced Examples">Advanced Examples</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Extending Actors</span></dt>
-<dt><span class="section">Adding an expression</span></dt>
-<dt><span class="section"><a href="examples/transforming_the_expression_tree.html">Transforming
-      the Expression Tree</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="inside/placeholder_unification.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/extending_actors.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,158 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Adding an expression</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../examples.html" title="Advanced Examples">
-<link rel="prev" href="extending_actors.html" title="Extending Actors">
-<link rel="next" href="transforming_the_expression_tree.html" title="Transforming the Expression Tree">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="extending_actors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transforming_the_expression_tree.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.examples.adding_an_expression"></a><a class="link" href="adding_an_expression.html" title="Adding an expression">Adding an expression</a>
-</h3></div></div></div>
-<p>
-        This is not a toy example. This is actually part of the library. Remember
-        the <a class="link" href="../modules/statement/while__statement.html" title="while_ Statement"><code class="computeroutput"><span class="keyword">while</span></code></a> lazy statement? Putting together
-        everything we've learned so far, we eill present it here in its entirety
-        (verbatim):
-      </p>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">boost</span><span class="special">)(</span><span class="identifier">phoenix</span><span class="special">)(</span><span class="identifier">while_</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>           <span class="comment">// Cond</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>           <span class="comment">// Do</span>
-<span class="special">)</span>
-
-<span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">phoenix</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">while_eval</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">void</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-        <span class="identifier">result_type</span>
-        <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">,</span> <span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">do_</span><span class="special">,</span> <span class="identifier">Context</span> <span class="special">&amp;</span> <span class="identifier">ctx</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">while</span><span class="special">(</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">))</span>
-            <span class="special">{</span>
-                <span class="identifier">eval</span><span class="special">(</span><span class="identifier">do_</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">);</span>
-            <span class="special">}</span>
-        <span class="special">}</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">default_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">while_</span><span class="special">,</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-        <span class="special">:</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="identifier">while_eval</span><span class="special">,</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-    <span class="special">{};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">while_gen</span>
-    <span class="special">{</span>
-        <span class="identifier">while_gen</span><span class="special">(</span><span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">cond</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span> <span class="special">{}</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">&gt;</span>
-        <span class="keyword">typename</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span>
-        <span class="keyword">operator</span><span class="special">[](</span><span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">do_</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">do_</span><span class="special">);</span>
-        <span class="special">}</span>
-
-        <span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">&gt;</span>
-    <span class="identifier">while_gen</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">&gt;</span> <span class="keyword">const</span>
-    <span class="identifier">while_</span><span class="special">(</span><span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">while_gen</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">&gt;(</span><span class="identifier">cond</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">}}</span>
-</pre>
-<p>
-        <code class="computeroutput"><span class="identifier">while_eval</span></code> is an example
-        of how to evaluate an expression. It gets called in the <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="keyword">while</span></code> action.
-        <code class="computeroutput"><span class="identifier">while_gen</span></code> and <code class="computeroutput"><span class="identifier">while_</span></code> are the expression template front
-        ends. Let's break this apart to undestand what's happening. Let's start at
-        the bottom. It's easier that way.
-      </p>
-<p>
-        When you write:
-      </p>
-<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
-</pre>
-<p>
-        we generate an instance of <code class="computeroutput"><span class="identifier">while_gen</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">&gt;</span></code>, where <code class="computeroutput"><span class="identifier">Cond</span></code>
-        is the type of <code class="computeroutput"><span class="identifier">cond</span></code>. <code class="computeroutput"><span class="identifier">cond</span></code> can be an arbitrarily complex actor
-        expression. The <code class="computeroutput"><span class="identifier">while_gen</span></code>
-        template class has an <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> accepting another expression. If we write:
-      </p>
-<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">do_</span>
-<span class="special">]</span>
-</pre>
-<p>
-        it will generate a proper composite with the type:
-      </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-        where <code class="computeroutput"><span class="identifier">Cond</span></code> is the type of
-        <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">Do</span></code>
-        is the type of <code class="computeroutput"><span class="identifier">do_</span></code>. Notice
-        how we are using Phoenix's <a class="link" href="../inside/expression.html" title="Phoenix Expressions">Expression</a>
-        mechanism here
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span>
-<span class="keyword">operator</span><span class="special">[](</span><span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">do_</span><span class="special">)</span> <span class="keyword">const</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">do_</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Finally, the <code class="computeroutput"><span class="identifier">while_eval</span></code> does
-        its thing:
-      </p>
-<pre class="programlisting"><span class="keyword">while</span><span class="special">(</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">))</span>
-<span class="special">{</span>
-    <span class="identifier">eval</span><span class="special">(</span><span class="identifier">do_</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">do_</span></code>,
-        at this point, are instances of <a class="link" href="../inside/actor.html" title="Actors in Detail">Actor</a>.
-        <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">do_</span></code>
-        are the <a class="link" href="../inside/actor.html" title="Actors in Detail">Actors</a> passed as parameters
-        by <code class="computeroutput"><span class="identifier">call</span></code>, ctx is the <a class="link" href="../inside/actor.html" title="Actors in Detail">Context</a>
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="extending_actors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transforming_the_expression_tree.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,320 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Extending Actors</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../examples.html" title="Advanced Examples">
-<link rel="prev" href="../examples.html" title="Advanced Examples">
-<link rel="next" href="adding_an_expression.html" title="Adding an expression">
-</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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adding_an_expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.examples.extending_actors"></a><a class="link" href="extending_actors.html" title="Extending Actors">Extending Actors</a>
-</h3></div></div></div>
-<p>
-        <a class="link" href="../inside/actor.html" title="Actors in Detail">Actors</a> are one of the main parts
-        of the library, and one of the many customization points. The default actor
-        implementation provides several operator() overloads which deal with the
-        evaluation of expressions.
-      </p>
-<p>
-        For some use cases this might not be enough. For convenience it is thinkable
-        to provide custom member functions which generate new expressions. An example
-        is the <a class="link" href="../modules/statement/___if_else_____statement.html" title="if_else_ Statement">if_else_
-Statement</a>
-        which provides an additional else member for generating a lazy if-else expression.
-        With this the actual Phoenix expression becomes more expressive.
-      </p>
-<p>
-        Another scenario is to give actors the semantics of a certain well known
-        interface or concept. This tutorial like section will provide information
-        on how to implement a custom actor which is usable as if it were a STL Container.
-      </p>
-<h5>
-<a name="phoenix.examples.extending_actors.h0"></a>
-        <span><a name="phoenix.examples.extending_actors.requirements"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.requirements">Requirements</a>
-      </h5>
-<p>
-        Let's repeat what we want to have:
-      </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns an iterator pointing to the first element in the container.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns an iterator pointing one past the last element in the container.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns the size of the container, that is, its number of elements.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">max_size</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns the largest size that this container can ever have.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Equivalent to a.size() == 0. (But possibly faster.)
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">swap</span><span class="special">(</span><span class="identifier">b</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Equivalent to swap(a,b)
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-<p>
-        Additionally, we want all the operator() overloads of the regular actor.
-      </p>
-<h5>
-<a name="phoenix.examples.extending_actors.h1"></a>
-        <span><a name="phoenix.examples.extending_actors.defining_the_actor"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.defining_the_actor">Defining the
-        actor</a>
-      </h5>
-<p>
-        The first version of our <code class="computeroutput"><span class="identifier">container_actor</span></code>
-        interface will show the general principle. This will be continually extended.
-        For the sake of simplicity, every member function generator will return
-        <a class="link" href="../modules/core/nothing.html" title="Nothing"><code class="computeroutput"><span class="identifier">nothing</span></code></a>
-        at first.
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">container_actor</span>
-	<span class="special">:</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="special">{</span>
-	<span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
-	<span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-	
-	<span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
-		<span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
-
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">max_size</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-
-	<span class="comment">// Note that swap is the only function needing another container.</span>
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">swap</span><span class="special">(</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Container</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-<span class="special">};</span>
-</pre>
-<h5>
-<a name="phoenix.examples.extending_actors.h2"></a>
-        <span><a name="phoenix.examples.extending_actors.using_the_actor"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.using_the_actor">Using
-        the actor</a>
-      </h5>
-<p>
-        Although the member functions do nothing right now, we want to test if we
-        can use our new actor.
-      </p>
-<p>
-        First, lets create a generator which wraps the <code class="computeroutput"><span class="identifier">container_actor</span></code>
-        around any other expression:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="keyword">const</span>
-<span class="identifier">container</span><span class="special">(</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">expr</span> <span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expr</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Now let's test this:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">v</span><span class="special">;</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">0</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">3</span><span class="special">);</span>
-
-<span class="special">(</span><span class="identifier">container</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">).</span><span class="identifier">size</span><span class="special">())(</span><span class="identifier">v</span><span class="special">);</span>
-</pre>
-<p>
-        Granted, this is not really elegant and not very practical (we could have
-        just used phoenix::begin(v) from the <a class="link" href="../modules/stl/algorithm.html" title="Algorithm">Phoenix
-        algorithm module</a>, but we can do better.
-      </p>
-<p>
-        Let's have an <a class="link" href="../modules/core/arguments.html" title="Arguments">argument placeholder</a>
-        which is usable as if it was a STL container:
-      </p>
-<pre class="programlisting"><span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">con1</span><span class="special">;</span>
-<span class="comment">// and so on ...</span>
-</pre>
-<p>
-        The above example can be rewritten as:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">v</span><span class="special">;</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">0</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">3</span><span class="special">);</span>
-
-<span class="special">(</span><span class="identifier">con1</span><span class="special">.</span><span class="identifier">size</span><span class="special">())(</span><span class="identifier">v</span><span class="special">);</span>
-</pre>
-<p>
-        Wow, that was easy!
-      </p>
-<h5>
-<a name="phoenix.examples.extending_actors.h3"></a>
-        <span><a name="phoenix.examples.extending_actors.adding_life_to_the_actor"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.adding_life_to_the_actor">Adding
-        life to the actor</a>
-      </h5>
-<p>
-        This one will be even easier!
-      </p>
-<p>
-        First, we define a <a class="link" href="../modules/function.html" title="Function">lazy function</a>
-        which evaluates the expression we want to implement. Following is the implementation
-        of the size function:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">size_impl</span>
-<span class="special">{</span>
-	<span class="comment">// result_of protocol:</span>
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-	<span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-	<span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">Container</span><span class="special">)&gt;</span>
-	<span class="special">{</span>
-		<span class="comment">// Note, remove reference here, because Container can be anything</span>
-		<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Container</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">container_type</span><span class="special">;</span>
-
-		<span class="comment">// The result will be size_type</span>
-		<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">container_type</span><span class="special">::</span><span class="identifier">size_type</span> <span class="identifier">type</span><span class="special">;</span>
-	<span class="special">};</span>
-
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-	<span class="keyword">typename</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">size_impl</span><span class="special">(</span><span class="identifier">Container</span> <span class="keyword">const</span><span class="special">&amp;)&gt;::</span><span class="identifier">type</span>
-	<span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Container</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">container</span><span class="special">)</span> <span class="keyword">const</span>
-	<span class="special">{</span>
-		<span class="keyword">return</span> <span class="identifier">container</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span>
-	<span class="special">}</span>
-<span class="special">};</span>
-</pre>
-<p>
-        Good, this was the first part. The second part will be to implement the size
-        member function of <code class="computeroutput"><span class="identifier">container_actor</span></code>:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">container_actor</span>
-	<span class="special">:</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="special">{</span>
-	<span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
-	<span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-	
-	<span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
-		<span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
-
-	<span class="keyword">typename</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">size_impl</span><span class="special">,</span> <span class="identifier">that_type</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span>
-	<span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span>
-	<span class="special">{</span>
-		<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">size_impl</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">f</span> <span class="special">=</span> <span class="identifier">size_impl</span><span class="special">();</span>
-		<span class="keyword">return</span> <span class="identifier">f</span><span class="special">(*</span><span class="keyword">this</span><span class="special">);</span>
-	<span class="special">}</span>
-
-	<span class="comment">// the rest ...</span>
-<span class="special">};</span>
-</pre>
-<p>
-        It is left as an exercise to the user to implement the missing parts by reusing
-        functions from the <a class="link" href="../modules/stl/algorithm.html" title="Algorithm">Phoenix
-        Algorithm Module</a> (the impatient take a look here: container_actor.cpp).
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adding_an_expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,198 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Transforming the Expression Tree</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../examples.html" title="Advanced Examples">
-<link rel="prev" href="adding_an_expression.html" title="Adding an expression">
-<link rel="next" href="../wrap_up.html" title="Wrap Up">
-</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="adding_an_expression.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../wrap_up.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.examples.transforming_the_expression_tree"></a><a class="link" href="transforming_the_expression_tree.html" title="Transforming the Expression Tree">Transforming
-      the Expression Tree</a>
-</h3></div></div></div>
-<p>
-        This example will show how to write <a class="link" href="../inside/actions.html" title="More on Actions">Actions</a>
-        that transform the Phoenix AST.
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          "<span class="emphasis"><em>Lisp macros transform the program structure itself, with
-          the full language available to express such transformations.</em></span>"
-        </p>
-<p>
-          Wikipedia
-        </p>
-</blockquote></div>
-<p>
-        What we want to do is to invert some arithmetic operators, i.e. plus will
-        be transformed to minus, minus to plus, multiplication to division and division
-        to multiplication.
-      </p>
-<p>
-        Let's start with defining our default action:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">invert_actions</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Rule</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">when</span>
-        <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span> <span class="comment">// the default is proto::_</span>
-    <span class="special">{};</span>
-<span class="special">};</span>
-</pre>
-<p>
-        By default, we don't want to do anything, well, not exactly nothing, but
-        just return the expression. This is done by proto::_
-        which, used as a transform, just passes the current expression along. Making
-        this action an identity transform.
-      </p>
-<p>
-        So, after the basics are set up, we can start by writing the transformations
-        we want to have on our tree:
-      </p>
-<pre class="programlisting"><span class="comment">// Transform plus to minus</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        Wow, this looks complicated! Granted you need to know a little bit about
-        Boost.Proto
-        (For a good introduction read through the <a href="http://cpp-next.com/archive/2010/08/expressive-c-introduction/" target="_top">Expressive
-        C++</a> series).
-      </p>
-<p>
-        What is done is the following:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            The left expression is passed to evaluator (with the current context,
-            that contains our invert_actions)
-          </li>
-<li class="listitem">
-            The right expression is passed to evaluator (with the current context,
-            that contains our invert_actions)
-          </li>
-<li class="listitem">
-            The result of these two <a href="http://www.boost.org/doc/libs/release/doc/html/Transform.html" target="_top">Proto
-            Transforms</a> is passed to proto::functional::make_expr which returns the
-            freshly created expression
-          </li>
-</ul></div>
-<p>
-        After you know what is going on, maybe the rest doesn't look so scary anymore:
-      </p>
-<pre class="programlisting"><span class="comment">// Transform minus to plus</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-
-<span class="comment">// Transform multiplies to divides</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-
-<span class="comment">// Transform divides to multiplies</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        That's it! Now that we have our actions defined, we want to evaluate some
-        of our expressions with them:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="comment">// Calculate the result type: our transformed AST</span>
-<span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">&lt;</span>
-    <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span>
-        <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&amp;</span>
-      <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">context</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">invert_actions</span><span class="special">&gt;::</span><span class="identifier">type</span>
-    <span class="special">)</span>
-<span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">Expr</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">expr</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span>
-        <span class="comment">// Evaluate it with our actions</span>
-        <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">eval</span><span class="special">(</span>
-            <span class="identifier">expr</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">context</span><span class="special">(</span>
-                <span class="keyword">int</span><span class="special">()</span>
-              <span class="special">,</span> <span class="identifier">invert_actions</span><span class="special">()</span>
-            <span class="special">)</span>
-        <span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Run some tests to see if it is working:
-      </p>
-<pre class="programlisting"><span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span><span class="special">);</span>                    <span class="comment">// --&gt; _1</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">_2</span><span class="special">);</span>               <span class="comment">// --&gt; _1 - _2</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 - _2 + _3</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span><span class="special">);</span>               <span class="comment">// --&gt; _1 / _2</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span> <span class="special">/</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 / _2 * _3</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span> <span class="special">+</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 / _2 - _3</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 / _2 + _2</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">if_</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_4</span><span class="special">)[</span><span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">]);</span> <span class="comment">// --&gt; if_(_1 / _4)[_2 + _3]</span>
-<span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">invert</span><span class="special">(</span><span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">));</span>         <span class="comment">// --&gt; _1 * _2 + _3</span>
-</pre>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/note.png" alt="note"></span> The complete example can be found here: example/invert.cpp
-      </p>
-<p>
-        <span class="emphasis"><em>Pretty simple ...</em></span>
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adding_an_expression.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../wrap_up.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,59 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Inside Phoenix</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="modules/stl/algorithm.html" title="Algorithm">
-<link rel="next" href="inside/actor.html" title="Actors in Detail">
-</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="modules/stl/algorithm.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inside/actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.inside"></a><a class="link" href="inside.html" title="Inside Phoenix">Inside Phoenix</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Actors in Detail</span></dt>
-<dt><span class="section">Phoenix Expressions</span></dt>
-<dd><dl><dt><span class="section"><a href="inside/expression/boilerplate_macros.html">Boilerplate
-        Macros</a></span></dt></dl></dd>
-<dt><span class="section">More on Actions</span></dt>
-<dt><span class="section">Predefined Expressions and Rules</span></dt>
-<dt><span class="section">Custom Terminals</span></dt>
-<dt><span class="section">Placeholder Unification</span></dt>
-</dl></div>
-<p>
-      This chapter explains in more detail how the library operates. The information
-      henceforth should not be necessary to those who are interested in just using
-      the library. However, a microscopic view might prove to be beneficial to advanced
-      programmers who wish to extend the library.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="modules/stl/algorithm.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inside/actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,209 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>More on Actions</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="expression/boilerplate_macros.html" title="Boilerplate Macros">
-<link rel="next" href="rules.html" title="Predefined Expressions and Rules">
-</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="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rules.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.actions"></a><a class="link" href="actions.html" title="More on Actions">More on Actions</a>
-</h3></div></div></div>
-<p>
-        As you know from the <a class="link" href="actor.html" title="Actors in Detail">Actors in Detail</a>
-        section, Actions are what brings life to a Phoenix expression tree.
-      </p>
-<p>
-        When dealing with a Phoenix expression tree, it gets evaluated top-down.
-        Example:
-      </p>
-<pre class="programlisting"><span class="identifier">_1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">*</span> <span class="identifier">_2</span>
-</pre>
-<p>
-        Can be visualized as an AST in the following way:
-      </p>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/simple_ast.png" alt="simple_ast"></span>
-      </p>
-<p>
-        In terms of actions this means:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span></code> is matched
-          </li>
-<li class="listitem">
-            evaluate left:
-            <div class="itemizedlist"><ul class="itemizedlist" type="circle"><li class="listitem">
-                  <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">placeholder</span></code> is matched
-                </li></ul></div>
-          </li>
-<li class="listitem">
-            evaluate right:
-            <div class="itemizedlist"><ul class="itemizedlist" type="circle"><li class="listitem">
-                  <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies</span></code> is matched
-                  <div class="itemizedlist"><ul class="itemizedlist" type="square">
-<li class="listitem">
-                        evaluate left:
-                        <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-                              <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">value</span></code>
-                              is matched
-                            </li></ul></div>
-                      </li>
-<li class="listitem">
-                        evaluate right:
-                        <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-                              <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">placeholder</span></code>
-                              is matched
-                            </li></ul></div>
-                      </li>
-</ul></div>
-                </li></ul></div>
-          </li>
-</ul></div>
-<p>
-        Every time a rule is matched, an action will be called. The action determines
-        how the Phoenix AST will be traversed.
-      </p>
-<h5>
-<a name="phoenix.inside.actions.h0"></a>
-        <span><a name="phoenix.inside.actions.writing_an_action"></a></span><a class="link" href="actions.html#phoenix.inside.actions.writing_an_action">Writing
-        an Action</a>
-      </h5>
-<p>
-        As mentioned in <a class="link" href="actor.html" title="Actors in Detail">Actors in Detail</a>
-        actions are <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-        Primitive Transforms</a> for convenience Phoenix provides an abstraction
-        to this:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Fun</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">call</span><span class="special">;</span>
-</pre>
-<p>
-        This is similar to proto::call but does more. It calls the
-        <code class="computeroutput"><span class="identifier">Fun</span></code> function object passed
-        as template parameter with the <code class="computeroutput"><span class="identifier">Context</span></code>
-        and the children of the expression associated with the rule.
-      </p>
-<p>
-        Lets have an (simplified) example on how to write an evaluation action for
-        <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span></code>:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">plus_eval</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="keyword">int</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-    <span class="identifier">result_type</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Lhs</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">Rhs</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="identifier">rhs</span><span class="special">,</span> <span class="identifier">Context</span> <span class="special">&amp;</span> <span class="identifier">ctx</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">eval</span><span class="special">(</span><span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">eval</span><span class="special">(</span><span class="identifier">rhs</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">default_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;</span>
-    <span class="special">:</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="identifier">plus_eval</span><span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        That's it. When evaluating a <code class="computeroutput"><span class="identifier">plus</span></code>
-        expression, the <code class="computeroutput"><span class="identifier">plus_eval</span></code>
-        callable gets called with the left hand side and right hand side expression
-        and the associated Context.
-      </p>
-<p>
-        <span class="bold"><strong>But there is more:</strong></span> As Actions <span class="emphasis"><em>can</em></span>
-        be full fletched <a href="http://www.boost.org/doc/libs/release/doc/html/Transform.html" target="_top">Proto
-        Transforms</a>, you can in fact use any proto expression you can imagine
-        as the action. Phoenix predifines a set of callables and transform to deal
-        with the Context information passed along and of course every Phoenix expression
-        can be used as a Phoenix grammar or <a href="http://www.boost.org/doc/libs/release/doc/html/boost/proto/pass_through.html" target="_top">Proto
-        Pass Through Transform</a>.
-      </p>
-<div class="variablelist">
-<p class="title"><b></b></p>
-<dl>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">functional</span><span class="special">::</span><span class="identifier">context</span><span class="special">(</span><span class="identifier">Env</span><span class="special">,</span> <span class="identifier">Actions</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/Callable.html" target="_top">Proto
-              Callable Transform</a> that creates a new context out of the <code class="computeroutput"><span class="identifier">Env</span></code> and <code class="computeroutput"><span class="identifier">Actions</span></code>
-              parameter
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">functional</span><span class="special">::</span><span class="identifier">env</span><span class="special">(</span><span class="identifier">Context</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/Callable.html" target="_top">Proto
-              Callable Transform</a> that returns the environment out of the
-              <code class="computeroutput"><span class="identifier">Context</span></code> parameter
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">functional</span><span class="special">::</span><span class="identifier">actions</span><span class="special">(</span><span class="identifier">Context</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/Callable.html" target="_top">Proto
-              Callable Transform</a> that returns the actions out of the <code class="computeroutput"><span class="identifier">Context</span></code> parameter
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">_context</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-              Primitive Transform</a> that returns the current context
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">_env</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-              Primitive Transform</a> that returns the current environment
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">_actions</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-              Primitive Transform</a> that returns the current actions
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">context</span><span class="special">(</span><span class="identifier">env</span><span class="special">,</span> <span class="identifier">actions</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A regular function that creates a context
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">env</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A regular function that returns the environment from the given context
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">actions</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A regular function that returns the actions from the given context
-            </p></dd>
-</dl>
-</div>
-<p>
-        Phoenix is equipped with a predefined set of expressions, rules and actions
-        to make all the stuff work you learned in the <a class="link" href="../starter_kit.html" title="Starter Kit">Starter
-        Kit</a> and <a class="link" href="../modules.html" title="Modules">Modules</a> sections. See
-        the <a class="link" href="rules.html" title="Predefined Expressions and Rules">next section</a> for more details!
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rules.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/actor.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,411 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Actors in Detail</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="../inside.html" title="Inside Phoenix">
-<link rel="next" href="expression.html" title="Phoenix Expressions">
-</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="../inside.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.actor"></a><a class="link" href="actor.html" title="Actors in Detail">Actors in Detail</a>
-</h3></div></div></div>
-<h5>
-<a name="phoenix.inside.actor.h0"></a>
-        <span><a name="phoenix.inside.actor.actor"></a></span><a class="link" href="actor.html#phoenix.inside.actor.actor">Actor</a>
-      </h5>
-<p>
-        The main concept is the <code class="computeroutput"><span class="identifier">Actor</span></code>.
-        An <code class="computeroutput"><span class="identifier">Actor</span></code> is a model of the
-        <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> concept (that can accept 0 to N arguments (where
-        N is a predefined maximum).
-      </p>
-<p>
-        An <code class="computeroutput"><span class="identifier">Actor</span></code> contains a valid
-        Phoenix Expression, a call to one of the function call operator overloads,
-        starts the evaluation process.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>,
-          the predefined maximum arity an actor can take. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code> is set to 10.
-        </p></td></tr>
-</table></div>
-<p>
-        The <code class="computeroutput"><span class="identifier">actor</span></code> template class
-        models the <code class="computeroutput"><span class="identifier">Actor</span></code> concept:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">actor</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-    <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;::</span><span class="identifier">type</span>
-    <span class="keyword">operator</span><span class="special">()()</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span> <span class="identifier">T0</span> <span class="special">&amp;&gt;::</span><span class="identifier">type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span> <span class="identifier">T0</span> <span class="keyword">const</span> <span class="special">&amp;&gt;::</span><span class="identifier">type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="comment">//...</span>
-<span class="special">};</span>
-</pre>
-<div class="table">
-<a name="phoenix.inside.actor.t0"></a><p class="title"><b>Table&#160;1.9.&#160;Actor Concept Requirements</b></p>
-<div class="table-contents"><table class="table" summary="Actor Concept Requirements">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">actor</span><span class="special">(</span><span class="identifier">arg0</span><span class="special">,</span>
-                  <span class="identifier">arg1</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">argN</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Function call operators to start the evaluation
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">&lt;</span><span class="identifier">Actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;(</span><span class="identifier">Arg0</span><span class="special">,</span>
-                  <span class="identifier">Arg1</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">ArgN</span><span class="special">)&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Result of the evaluation
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span>
-                  <span class="identifier">Arg0</span><span class="special">,</span>
-                  <span class="identifier">Arg1</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">ArgN</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Result of the evaluation
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><h5>
-<a name="phoenix.inside.actor.h1"></a>
-        <span><a name="phoenix.inside.actor.function_call_operators"></a></span><a class="link" href="actor.html#phoenix.inside.actor.function_call_operators">Function
-        Call Operators</a>
-      </h5>
-<p>
-        There are 2*N function call operators for 0 to N arguments (N == <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>). The actor class accepts
-        the arguments and forwards the arguments to the default evaluation action.
-      </p>
-<p>
-        Additionally, there exist function call operators accepting permutations
-        of const and non-const references. These operators are created for all N
-        &lt;= <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARD_LIMIT</span></code>
-        (which defaults to 3).
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top">
-<p>
-          <span class="bold"><strong>Forwarding Function Problem</strong></span>
-        </p>
-<p>
-          There is a known issue with current C++ called the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
-          Function Problem</a>". The problem is that given an arbitrary
-          function <code class="computeroutput"><span class="identifier">F</span></code>, using current
-          C++ language rules, one cannot create a forwarding function <code class="computeroutput"><span class="identifier">FF</span></code> that transparently assumes the arguments
-          of <code class="computeroutput"><span class="identifier">F</span></code>.
-        </p>
-</td></tr>
-</table></div>
-<h5>
-<a name="phoenix.inside.actor.h2"></a>
-        <span><a name="phoenix.inside.actor.context"></a></span><a class="link" href="actor.html#phoenix.inside.actor.context">Context</a>
-      </h5>
-<p>
-        On an actor function call, before calling the evaluation function, the actor
-        created a <span class="bold"><strong>context</strong></span>. This context consists
-        of an <code class="computeroutput"><span class="identifier">Environment</span></code> and an
-        <code class="computeroutput"><span class="identifier">Action</span></code> part. These contain
-        all information necessary to evaluate the given expression.
-      </p>
-<div class="table">
-<a name="phoenix.inside.actor.t1"></a><p class="title"><b>Table&#160;1.10.&#160;Context Concept Requirements</b></p>
-<div class="table-contents"><table class="table" summary="Context Concept Requirements">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">context</span><span class="special">&lt;</span><span class="identifier">Env</span><span class="special">,</span>
-                  <span class="identifier">Actions</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Type of a Context
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">context</span><span class="special">(</span><span class="identifier">e</span><span class="special">,</span>
-                  <span class="identifier">a</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  A Context containing environment <code class="computeroutput"><span class="identifier">e</span></code>
-                  and actions <code class="computeroutput"><span class="identifier">a</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">env</span><span class="special">&lt;</span><span class="identifier">Context</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Type of the contained Environment
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">env</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  The environment
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actions</span><span class="special">&lt;</span><span class="identifier">Context</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Type of the contained Actions
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">actions</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  The actions
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><h5>
-<a name="phoenix.inside.actor.h3"></a>
-        <span><a name="phoenix.inside.actor.environment"></a></span><a class="link" href="actor.html#phoenix.inside.actor.environment">Environment</a>
-      </h5>
-<p>
-        The Environment is a model of <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/sequence/concepts/random_access_sequence.html" target="_top">Random
-        Access Sequence</a>.
-      </p>
-<p>
-        The arguments passed to the actor's function call operator are collected
-        inside the Environment:
-      </p>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/funnel_in.png" alt="funnel_in"></span>
-      </p>
-<p>
-        Other parts of the library (e.g. the scope module) extends the <code class="computeroutput"><span class="identifier">Environment</span></code> concept to hold other information
-        such as local variables, etc.
-      </p>
-<h5>
-<a name="phoenix.inside.actor.h4"></a>
-        <span><a name="phoenix.inside.actor.actions"></a></span><a class="link" href="actor.html#phoenix.inside.actor.actions">Actions</a>
-      </h5>
-<p>
-        Actions is the part of Phoenix which are responsible for giving the actual
-        expressions a specific behaviour. During the traversal of the Phoenix Expression
-        Tree these actions are called whenever a specified rule in the grammar matches.
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">actions</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Rule</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">when</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-        The nested <code class="computeroutput"><span class="identifier">when</span></code> template
-        is required to be <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-        Primitive Transform</a>. No worries, you don't have to learn Boost.Proto
-        just yet! Phoenix provides some wrappers to let you define simple actions
-        without the need to dive deep into proto.
-      </p>
-<p>
-        Phoenix ships with a predefined <code class="computeroutput"><span class="identifier">default_actions</span></code>
-        class that evaluates the expressions with C++ semantics:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">default_actions</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Rule</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Dummy</span> <span class="special">=</span> <span class="keyword">void</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">when</span>
-        <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">_default</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">};</span>
-</pre>
-<p>
-        For more information on how to use the default_actions class and how to attach
-        custom actions to the evaluation process, see <a class="link" href="actions.html" title="More on Actions">more
-        on actions</a>.
-      </p>
-<h5>
-<a name="phoenix.inside.actor.h5"></a>
-        <span><a name="phoenix.inside.actor.evaluation"></a></span><a class="link" href="actor.html#phoenix.inside.actor.evaluation">Evaluation</a>
-      </h5>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">evaluator</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-    <span class="emphasis"><em>unspecified</em></span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Expr</span> <span class="special">&amp;,</span> <span class="identifier">Context</span> <span class="special">&amp;);</span>
-<span class="special">};</span>
-
-<span class="identifier">evaluator</span> <span class="keyword">const</span> <span class="identifier">eval</span> <span class="special">=</span> <span class="special">{};</span>
-</pre>
-<p>
-        The evaluation of a Phoenix expression is started by a call to the function
-        call operator of <code class="computeroutput"><span class="identifier">evaluator</span></code>.
-      </p>
-<p>
-        The evaluator is called by the <code class="computeroutput"><span class="identifier">actor</span></code>
-        function operator overloads after the context is built up. For reference,
-        here is a typical <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code>
-        that accepts two arguments:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span> <span class="identifier">T0</span> <span class="special">&amp;,</span> <span class="identifier">T1</span> <span class="special">&amp;&gt;::</span><span class="identifier">type</span>
-<span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span> <span class="special">&amp;</span><span class="identifier">t0</span><span class="special">,</span> <span class="identifier">T1</span> <span class="special">&amp;</span><span class="identifier">t1</span><span class="special">)</span> <span class="keyword">const</span>
-<span class="special">{</span>
-    <span class="identifier">fusion</span><span class="special">::</span><span class="identifier">vector2</span><span class="special">&lt;</span><span class="identifier">T0</span> <span class="special">&amp;,</span> <span class="identifier">T1</span> <span class="special">&amp;&gt;</span> <span class="identifier">env</span><span class="special">(</span><span class="identifier">t0</span><span class="special">,</span> <span class="identifier">t1</span><span class="special">);</span>
-
-    <span class="keyword">return</span> <span class="identifier">eval</span><span class="special">(*</span><span class="keyword">this</span><span class="special">,</span> <span class="identifier">context</span><span class="special">(</span><span class="identifier">env</span><span class="special">,</span> <span class="identifier">default_actions</span><span class="special">()));</span>
-<span class="special">}</span>
-</pre>
-<h5>
-<a name="phoenix.inside.actor.h6"></a>
-        <span><a name="phoenix.inside.actor.result_of__actor"></a></span><a class="link" href="actor.html#phoenix.inside.actor.result_of__actor">result_of::actor</a>
-      </h5>
-<p>
-        For reasons of symmetry to the family of <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> there is a special metafunction usable
-        for actor result type calculation named <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span></code>.
-        This metafunction allows us to directly specify the types of the parameters
-        to be passed to the <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> function. Here's a typical <code class="computeroutput"><span class="identifier">actor_result</span></code> that accepts two arguments:
-      </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">actor</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="identifier">fusion</span><span class="special">::</span><span class="identifier">vector2</span><span class="special">&lt;</span><span class="identifier">T0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">&gt;</span>                                           <span class="identifier">env_tpe</span><span class="special">;</span>
-        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">context</span><span class="special">&lt;</span><span class="identifier">env_type</span><span class="special">,</span> <span class="identifier">default_actions</span><span class="special">&gt;::</span><span class="identifier">type</span>      <span class="identifier">ctx_type</span>
-        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">&lt;</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&amp;,</span> <span class="identifier">ctx_type</span><span class="special">)&gt;::</span><span class="identifier">type</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-<span class="special">}</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../inside.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Custom Terminals</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="rules.html" title="Predefined Expressions and Rules">
-<link rel="next" href="placeholder_unification.html" title="Placeholder Unification">
-</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="rules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="placeholder_unification.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.custom_terminals"></a><a class="link" href="custom_terminals.html" title="Custom Terminals">Custom Terminals</a>
-</h3></div></div></div>
-<p>
-        Custom Terminals are used in Phoenix to handle special values transparently.
-        For example, as Phoenix captures everything by value, we needed to use <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span></code> to bring reference semantics
-        into Phoenix.
-      </p>
-<p>
-        Custom terminals could be any wrapper class:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">is_custom_terminal</span><span class="special">;</span>
-</pre>
-<p>
-        needs to be specialized in order for Phoenix to recognize this wrapper type.
-        <code class="computeroutput"><span class="identifier">default_action</span></code> calls <code class="computeroutput"><span class="identifier">custom_terminal</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code>.
-      </p>
-<p>
-        Example:
-      </p>
-<pre class="programlisting"><span class="comment">// Call out boost::reference_wrapper for special handling</span>
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">is_custom_terminal</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-  <span class="special">:</span> <span class="identifier">mpl</span><span class="special">::</span><span class="identifier">true_</span>
-<span class="special">{};</span>
-
-<span class="comment">// Special handling for boost::reference_wrapper</span>
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">custom_terminal</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="identifier">result_type</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-    <span class="identifier">T</span> <span class="special">&amp;</span><span class="keyword">operator</span><span class="special">()(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">Context</span> <span class="special">&amp;)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">r</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="rules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="placeholder_unification.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,273 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Phoenix Expressions</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="actor.html" title="Actors in Detail">
-<link rel="next" href="expression/boilerplate_macros.html" title="Boilerplate Macros">
-</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="actor.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.expression"></a><a class="link" href="expression.html" title="Phoenix Expressions">Phoenix Expressions</a>
-</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="expression/boilerplate_macros.html">Boilerplate
-        Macros</a></span></dt></dl></div>
-<p>
-        A Phoenix Expression is a model of the <a href="http://www.boost.org/doc/libs/release/doc/html/Expr.html" target="_top">Proto
-        Expression</a> Concept. These expressions are wrapped inside an <a class="link" href="actor.html" title="Actors in Detail">Actor</a> template. The <code class="computeroutput"><span class="identifier">actor</span></code>
-        provides the function call operator which evaluates the expressions. The
-        <code class="computeroutput"><span class="identifier">actor</span></code> is the domain specific
-        wrapper around Phoenix expressions.
-      </p>
-<p>
-        By design, Phoenix Expressions do not carry any information on how they will
-        be evaluated later on. They are the data structure on which the <code class="computeroutput"><span class="identifier">Actions</span></code> will work.
-      </p>
-<p>
-        The library provides a convenience template to define expressions:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span><span class="special">&gt;</span> <span class="identifier">Actor</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">expr_ext</span>
-    <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">transform</span><span class="special">&lt;</span><span class="identifier">expr_ext</span><span class="special">&lt;</span><span class="identifier">Actor</span><span class="special">,</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">A1</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="emphasis"><em>unspecified</em></span> <span class="identifier">base_expr</span><span class="special">;</span>
-    <span class="keyword">typedef</span> <span class="identifier">Actor</span><span class="special">&lt;</span><span class="identifier">base_expr</span><span class="special">&gt;</span> <span class="identifier">type</span><span class="special">;</span>
-
-    <span class="keyword">typedef</span> <span class="emphasis"><em>unspecified</em></span> <span class="identifier">proto_grammar</span><span class="special">;</span>
-
-    <span class="keyword">static</span> <span class="identifier">type</span> <span class="identifier">make</span><span class="special">(</span><span class="identifier">A0</span> <span class="identifier">a0</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">A1</span> <span class="identifier">a1</span><span class="special">);</span>
-<span class="special">};</span>
-
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">expr</span> <span class="special">:</span> <span class="identifier">expr_ext</span><span class="special">&lt;</span><span class="identifier">actor</span><span class="special">,</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">A1</span><span class="special">&gt;</span> <span class="special">{};</span>
-</pre>
-<p>
-        <span class="bold"><strong>Notation</strong></span>
-      </p>
-<div class="variablelist">
-<p class="title"><b></b></p>
-<dl>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span></code></span></dt>
-<dd><p>
-              Child node types
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">a0</span><span class="special">...</span><span class="identifier">aN</span></code></span></dt>
-<dd><p>
-              Child node objects
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">G0</span><span class="special">...</span><span class="identifier">GN</span></code></span></dt>
-<dd><p>
-              Boost.Proto
-              grammar types
-            </p></dd>
-</dl>
-</div>
-<p>
-        <span class="bold"><strong>Expression Semantics</strong></span>
-      </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">Tag</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  The type of Expression having tag <code class="computeroutput"><span class="identifier">Tag</span></code>
-                  and <code class="computeroutput"><span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span></code> children
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">Tag</span><span class="special">,</span>
-                  <span class="identifier">G0</span><span class="special">...</span><span class="identifier">GN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  A Boost.Proto
-                  grammar and <a href="http://www.boost.org/doc/libs/release/doc/html/boost/proto/pass_through.html" target="_top">Proto
-                  Pass Through Transform</a>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">Tag</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">a0</span><span class="special">...</span><span class="identifier">aN</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns a Phoenix Expression
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          You might have noticed the template template argument <code class="computeroutput"><span class="identifier">Actor</span></code>
-          used in <code class="computeroutput"><span class="identifier">expr_ext</span></code>. This
-          can be a user supplied custom Actor adding other member functions or objects
-          than the default <code class="computeroutput"><span class="identifier">actor</span></code>
-          template. See <a class="link" href="../examples/extending_actors.html" title="Extending Actors">Extending
-          Actors</a> for more details.
-        </p></td></tr>
-</table></div>
-<h5>
-<a name="phoenix.inside.expression.h0"></a>
-        <span><a name="phoenix.inside.expression.meta_grammar"></a></span><a class="link" href="expression.html#phoenix.inside.expression.meta_grammar">meta_grammar</a>
-      </h5>
-<p>
-        Defining expressions is only part of the game to make it a valid Phoenix
-        Expression. In order to use the expressions in the Phoenix domain, we need
-        to "register" them to our grammar.
-      </p>
-<p>
-        The <code class="computeroutput"><span class="identifier">meta_grammar</span></code> is a struct
-        for exactly that purpose. It is an openly extendable Boost.Proto
-        Grammar:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">meta_grammar</span>
-    <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">switch_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">case_</span>
-        <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">not_</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">};</span>
-</pre>
-<p>
-        As you can see, by default the <code class="computeroutput"><span class="identifier">meta_grammar</span></code>
-        matches nothing. With every <a class="link" href="../modules.html" title="Modules">Module</a>
-        you include this grammar gets extended by various expressions.
-      </p>
-<h5>
-<a name="phoenix.inside.expression.h1"></a>
-        <span><a name="phoenix.inside.expression.example"></a></span><a class="link" href="expression.html#phoenix.inside.expression.example">Example</a>
-      </h5>
-<p>
-        Define an expression:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">plus</span>
-    <span class="special">:</span> <span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        And add it to the grammar:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;</span>
-    <span class="special">:</span> <span class="identifier">enable_rule</span><span class="special">&lt;</span>
-        <span class="identifier">plus</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">meta_grammar</span>
-        <span class="special">&gt;</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        Define a generator function to make the life of our potential users easier:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">plus</span><span class="special">(</span><span class="identifier">Lhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">Rhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">rhs</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">rhs</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Look if it really works:
-      </p>
-<pre class="programlisting"><span class="identifier">plus</span><span class="special">(</span><span class="number">6</span><span class="special">,</span> <span class="number">5</span><span class="special">)();</span>
-</pre>
-<p>
-        returns 11!
-      </p>
-<pre class="programlisting"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">display_expr</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="number">5</span><span class="special">,</span> <span class="number">6</span><span class="special">));</span>
-</pre>
-<p>
-        prints:
-      </p>
-<pre class="programlisting"><span class="identifier">plus</span><span class="special">(</span>
-    <span class="identifier">terminal</span><span class="special">(</span><span class="number">6</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">terminal</span><span class="special">(</span><span class="number">5</span><span class="special">)</span>
-<span class="special">)</span>
-</pre>
-<p>
-        See define_expression.cpp
-        for the full example.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          The example shown here only works because <code class="computeroutput"><span class="identifier">default_actions</span></code>
-          knows how to handle an expression having the <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span></code>
-          and two children. This is because <code class="computeroutput"><span class="identifier">default_actions</span></code>
-          uses the <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_default</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span></code>
-          transform to evaluate operators and functions. Learn more about actions
-          <a class="link" href="actions.html" title="More on Actions">here</a>.
-        </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="actor.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,515 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Boilerplate Macros</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../expression.html" title="Phoenix Expressions">
-<link rel="prev" href="../expression.html" title="Phoenix Expressions">
-<link rel="next" href="../actions.html" title="More on Actions">
-</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="../expression.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../expression.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../actions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros"></a><a class="link" href="boilerplate_macros.html" title="Boilerplate Macros">Boilerplate
-        Macros</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION</span></dt>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span></dt>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span></dt>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</span></dt>
-</dl></div>
-<p>
-          When having more and more expressions, you start to realize that this is
-          a very repetetive task. Phoenix provides boilerplate macros that make defining
-          Phoenix Expressions as you have seen in the <a class="link" href="../expression.html" title="Phoenix Expressions">previous
-          section</a> look like a piece of cake.
-        </p>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression" title="BOOST_PHOENIX_DEFINE_EXPRESSION">BOOST_PHOENIX_DEFINE_EXPRESSION</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            The sequence of <code class="computeroutput"><span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span></code> declares how many children the expression
-            will have and what <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">grammar</span></code>
-            they match.
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">child_grammarN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.example">Example</a>
-          </h6>
-<p>
-            The example from the previous section can be rewritten as:
-          </p>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">plus</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>               <span class="comment">// Lhs</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>               <span class="comment">// Rhs</span>
-<span class="special">)</span>
-
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">plus</span><span class="special">(</span><span class="identifier">Lhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">Rhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">rhs</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">rhs</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg" title="BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-    <span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">N</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            <code class="computeroutput"><span class="identifier">N</span></code> is the maximum number
-            of variable children. All but the last elements in the grammar sequence
-            are required children of the expression, and the last denotes a variable
-            number of children. The number of children an expression of this kind
-            can hold is therefor <code class="computeroutput"><span class="identifier">N</span><span class="special">-</span><span class="number">1</span></code> plus
-            the size of the sequence
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">name</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">child_grammarN</span><span class="special">&gt;</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">boost</span><span class="special">)(</span><span class="identifier">phoenix</span><span class="special">)(</span><span class="identifier">mem_fun_ptr</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>                <span class="comment">// Pointer to Object</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>                <span class="comment">// Member pointer</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>                <span class="comment">// Variable number of arguments</span>
-  <span class="special">,</span> <span class="identifier">BOOST_PHOENIX_LIMIT</span>
-<span class="special">)</span>
-</pre>
-<p>
-            This defines the member function pointer operator expression as described
-            in <a class="link" href="../../modules/operator.html" title="Operator">operators</a>.
-          </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext" title="BOOST_PHOENIX_DEFINE_EXPRESSION_EXT">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span><span class="special">(</span>
-    <span class="identifier">actor</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-    <span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">N</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            The sequence of <code class="computeroutput"><span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span></code> declares how many children the expression
-            will have and what <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">grammar</span></code>
-            they match.
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr_ext</span><span class="special">&lt;</span>
-            <span class="identifier">actor</span>
-          <span class="special">,</span> <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">child_grammarN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span><span class="special">(</span>
-    <span class="identifier">if_actor</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">boost</span><span class="special">)(</span><span class="identifier">phoenix</span><span class="special">)(</span><span class="identifier">if_</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span> <span class="comment">// Cond</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span> <span class="comment">// Then</span>
-<span class="special">)</span>
-</pre>
-<p>
-            This defines the if_ expression. The custom actor defines <code class="computeroutput"><span class="identifier">else_</span></code> as a member.
-          </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg" title="BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</span><span class="special">(</span>
-    <span class="identifier">actor</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-    <span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">N</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            <code class="computeroutput"><span class="identifier">N</span></code> is the maximum number
-            of variable children. All but the last elements in the grammar sequence
-            are required children of the expression, and the last denotes a variable
-            number of children. The number of children an expression of this kind
-            can hold is therefor <code class="computeroutput"><span class="identifier">N</span><span class="special">-</span><span class="number">1</span></code> plus
-            the size of the sequence
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr_ext</span><span class="special">&lt;</span>
-            <span class="identifier">actor</span>
-          <span class="special">,</span> <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">name</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">child_grammarN</span><span class="special">&gt;</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.example">Example</a>
-          </h6>
-<p>
-            TBD
-          </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../expression.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../expression.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../actions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Placeholder Unification</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="custom_terminals.html" title="Custom Terminals">
-<link rel="next" href="../examples.html" title="Advanced 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="custom_terminals.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.placeholder_unification"></a><a class="link" href="placeholder_unification.html" title="Placeholder Unification">Placeholder Unification</a>
-</h3></div></div></div>
-<p>
-        Phoenix uses <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_placeholder</span></code> for recognizing placeholders:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">is_placeholder</span>
-<span class="special">{</span>
-    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">value</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-        To adapt your own placeholder, the nested value needs to be greater than
-        0 for your types. This is done by specializing this trait.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="custom_terminals.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/inside/rules.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,1314 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Predefined Expressions and Rules</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="actions.html" title="More on Actions">
-<link rel="next" href="custom_terminals.html" title="Custom Terminals">
-</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="actions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="custom_terminals.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.rules"></a><a class="link" href="rules.html" title="Predefined Expressions and Rules">Predefined Expressions and Rules</a>
-</h3></div></div></div>
-<p>
-        This section is the "behind the scenes" counter part of the <a class="link" href="../modules.html" title="Modules">Modules</a> section. A listing of all the predefined
-        expressions and rules:
-      </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Rule
-                </p>
-              </th>
-<th>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">value</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">custom_terminal</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">argument</span></pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">custom_terminal</span></pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">F</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">function</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">negate</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">negate</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">unary_plus</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">unary_plus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_inc</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_inc</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_dec</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_dec</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_inc</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_inc</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_dec</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_dec</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">minus_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">divides_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">modules_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">modules_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">modules_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">minus</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">divides</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">modulus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">modulus</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">modulus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">complement</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">complement</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">complement</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_and_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_or_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_xor_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_left_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_right_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_and</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_or</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_xor</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_left</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_right</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">equal_to</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">not_equal_to</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">not_equal_to</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">not_equal_to</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">less_equal_to</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">less_equal_to</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">less_equal_to</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater_equal</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">greater_equal</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater_equal</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">less</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">less</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">less</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">greater</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else_operator</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Then</span><span class="special">,</span>
-                  <span class="identifier">Else</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">if_else</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_not</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">logical_not</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_not</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_and</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">logical_and</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_and</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_or</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">logical_or</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_or</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">mem_fun_ptr</span><span class="special">&lt;</span><span class="identifier">Object</span><span class="special">,</span>
-                  <span class="identifier">MemPtr</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">mem_fun_ptr</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">mem_fun_ptr</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">address_of</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">address_of</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">address_of</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">dereference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">dereference</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">dereference</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">subscript</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">subscript</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">subscript</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">sequence</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span>
-                  <span class="identifier">A1</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">sequence</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">sequence</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Then</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">if_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else_statement</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Then</span><span class="special">,</span>
-                  <span class="identifier">Else</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">if_else_statement</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else_statement</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_case</span><span class="special">&lt;</span><span class="identifier">Label</span><span class="special">,</span>
-                  <span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">switch_case</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_case</span><span class="special">&lt;</span> <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">int_</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;</span> <span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_default_case</span><span class="special">&lt;</span><span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">switch_default_case</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_default_case</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Cases</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">switch_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">switch_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Do</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">while_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">do_while</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Do</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">do_while</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">do_while</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">for_</span><span class="special">&lt;</span><span class="identifier">Init</span><span class="special">,</span>
-                  <span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Step</span><span class="special">,</span>
-                  <span class="identifier">Do</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">for_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">for_</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">Exception</span><span class="special">,</span>
-                  <span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&lt;</span>
-        <span class="identifier">catch_exception</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_all</span><span class="special">&lt;</span><span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_all</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span><span class="identifier">Try</span><span class="special">,</span>
-                  <span class="identifier">Catch0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">CatchN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">try_catch</span>
-    <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">or_</span><span class="special">&lt;</span>
-        <span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&gt;</span>
-        <span class="special">&gt;</span>
-      <span class="special">,</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&gt;</span>
-          <span class="special">,</span> <span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_all</span>
-        <span class="special">&gt;</span>
-      <span class="special">,</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">catch_all</span>
-        <span class="special">&gt;</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">throw_</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">throw_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">throw_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">construct</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">construct</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A0</span>
-       <span class="special">...</span>
-     <span class="special">,</span> <span class="identifier">AN</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">new_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">new_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A0</span>
-       <span class="special">...</span>
-     <span class="special">,</span> <span class="identifier">AN</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">delete_</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">delete_</span>
-      <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">delete_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">static_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">static_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">dynamic_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">dynamic_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">dynamic_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reinterpret_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">reinterpret_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">reinterpret_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">const_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">const_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">const_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">custom_terminal</span></pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">let</span><span class="special">&lt;</span><span class="identifier">Locals</span><span class="special">,</span>
-                  <span class="identifier">Statement</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">let</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">let</span><span class="special">&lt;</span><span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda</span><span class="special">&lt;</span><span class="identifier">OuterEnv</span><span class="special">,</span>
-                  <span class="identifier">Locals</span><span class="special">,</span>
-                  <span class="identifier">Statement</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">lambda</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda</span><span class="special">&lt;</span><span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda_actor</span><span class="special">&lt;</span><span class="identifier">Locals</span><span class="special">,</span>
-                  <span class="identifier">Statement</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">lambda_actor</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda_actor</span><span class="special">&lt;</span><span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="actions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="custom_terminals.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/introduction.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/introduction.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,70 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="what_s_new/phoenix_3_0.html" title="Phoenix 3.0">
-<link rel="next" href="starter_kit.html" title="Starter Kit">
-</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="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
-</h2></div></div></div>
-<p>
-      <span class="inlinemediaobject"><img src="../images/banner.png" alt="banner"></span>
-    </p>
-<p>
-      The Phoenix library enables FP techniques such as higher order functions,
-      <span class="emphasis"><em>lambda</em></span> (unnamed functions), <span class="emphasis"><em>currying</em></span>
-      (partial function application) and lazy evaluation in C++. The focus is more
-      on usefulness and practicality than purity, elegance and strict adherence to
-      FP principles.
-    </p>
-<p>
-      FP is a programming discipline that is not at all tied to a specific language.
-      FP as a programming discipline can, in fact, be applied to many programming
-      languages. In the realm of C++ for instance, we are seeing more FP techniques
-      being applied. C++ is sufficiently rich to support at least some of the most
-      important facets of FP. C++ is a multiparadigm programming language. It is
-      not only procedural. It is not only object oriented. Beneath the core of the
-      standard C++ library, a closer look into STL gives us a glimpse of FP already
-      in place. It is obvious that the authors of STL know and practice FP. In the
-      near future, we shall surely see more FP trickle down into the mainstream.
-    </p>
-<p>
-      The truth is, most of the FP techniques can coexist quite well with the standard
-      object oriented and imperative programming paradigms. When we are using STL
-      algorithms and functors (function objects) for example, we are already doing
-      FP. Phoenix is an evolutionary next step.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,101 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Modules</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="actor.html" title="Actor">
-<link rel="next" href="modules/core.html" title="Core">
-</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="actor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules/core.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.modules"></a><a class="link" href="modules.html" title="Modules">Modules</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Core</span></dt>
-<dd><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Nothing</span></dt>
-</dl></dd>
-<dt><span class="section">Function</span></dt>
-<dd><dl><dt><span class="section"><a href="modules/function/adapting_functions.html">Adapting
-        Functions</a></span></dt></dl></dd>
-<dt><span class="section">Operator</span></dt>
-<dt><span class="section">Statement</span></dt>
-<dd><dl>
-<dt><span class="section">Block Statement</span></dt>
-<dt><span class="section">if_ Statement</span></dt>
-<dt><span class="section">if_else_ Statement</span></dt>
-<dt><span class="section"><a href="modules/statement/switch__statement.html">switch_
-        Statement</a></span></dt>
-<dt><span class="section"><a href="modules/statement/while__statement.html">while_
-        Statement</a></span></dt>
-<dt><span class="section">do_while_ Statement</span></dt>
-<dt><span class="section">for_ Statement</span></dt>
-<dt><span class="section"><a href="modules/statement/try__catch__statement.html">try_
-        catch_ Statement</a></span></dt>
-<dt><span class="section">throw_</span></dt>
-</dl></dd>
-<dt><span class="section">Object</span></dt>
-<dd><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section">New</span></dt>
-<dt><span class="section">Delete</span></dt>
-<dt><span class="section">Casts</span></dt>
-</dl></dd>
-<dt><span class="section">Scope</span></dt>
-<dd><dl>
-<dt><span class="section">Local Variables</span></dt>
-<dt><span class="section">let</span></dt>
-<dt><span class="section">lambda</span></dt>
-</dl></dd>
-<dt><span class="section">Bind</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="modules/bind/binding_function_objects.html">Binding
-        Function Objects</a></span></dt>
-<dt><span class="section">Binding Functions</span></dt>
-<dt><span class="section"><a href="modules/bind/binding_member_functions.html">Binding
-        Member Functions</a></span></dt>
-<dt><span class="section"><a href="modules/bind/binding_member_variables.html">Binding
-        Member Variables</a></span></dt>
-<dt><span class="section"><a href="modules/bind/compatibility_with_boost_bind.html">Compatibility
-        with Boost.Bind</a></span></dt>
-</dl></dd>
-<dt><span class="section">STL</span></dt>
-<dd><dl>
-<dt><span class="section">Container</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-</dl></dd>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="actor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules/core.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Bind</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="scope/lambda.html" title="lambda">
-<link rel="next" href="bind/binding_function_objects.html" title="Binding Function Objects">
-</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="scope/lambda.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bind/binding_function_objects.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.bind"></a><a class="link" href="bind.html" title="Bind">Bind</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="bind/binding_function_objects.html">Binding
-        Function Objects</a></span></dt>
-<dt><span class="section">Binding Functions</span></dt>
-<dt><span class="section"><a href="bind/binding_member_functions.html">Binding
-        Member Functions</a></span></dt>
-<dt><span class="section"><a href="bind/binding_member_variables.html">Binding
-        Member Variables</a></span></dt>
-<dt><span class="section"><a href="bind/compatibility_with_boost_bind.html">Compatibility
-        with Boost.Bind</a></span></dt>
-</dl></div>
-<p>
-        <span class="emphasis"><em>Binding</em></span> is the act of tying together a function to some
-        arguments for deferred (lazy) evaluation. Named <a class="link" href="function.html" title="Function">lazy
-        functions</a> require a bit of typing. Unlike (unnamed) lambda expressions,
-        we need to write a functor somewhere offline, detached from the call site.
-        If you wish to transform a plain function, member function or member variable
-        to a lambda expression, <code class="computeroutput"><span class="identifier">bind</span></code>
-        is your friend.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Take note that binding functions, member functions or member variables
-          is monomorphic. Rather than binding functions, the preferred way is to
-          write true generic and polymorphic <a class="link" href="function.html" title="Function">lazy
-          functions</a>.
-        </p></td></tr>
-</table></div>
-<p>
-        There is a set of overloaded <code class="computeroutput"><span class="identifier">bind</span></code>
-        template functions. Each <code class="computeroutput"><span class="identifier">bind</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-        function generates a suitable binder object.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="scope/lambda.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bind/binding_function_objects.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Function Objects</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="../bind.html" title="Bind">
-<link rel="next" href="binding_functions.html" title="Binding Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../bind.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_function_objects"></a><a class="link" href="binding_function_objects.html" title="Binding Function Objects">Binding
-        Function Objects</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_function_object</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Binding function objects serves two purposes: * Partial function application
-          * Quick adaption of already existing function objects
-        </p>
-<p>
-          In order to deduce the return type of the function object, it has to implement
-          the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-          Of</a> protocol. If the bound function object is polymorphic, the resulting
-          binding object is polymorphic.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../bind.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,69 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_function_objects.html" title="Binding Function Objects">
-<link rel="next" href="binding_member_functions.html" title="Binding Member Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_function_objects.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_functions"></a><a class="link" href="binding_functions.html" title="Binding Functions">Binding Functions</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Example, given a function <code class="computeroutput"><span class="identifier">foo</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">n</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-          Here's how the function <code class="computeroutput"><span class="identifier">foo</span></code>
-          may be bound:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>
-</pre>
-<p>
-          This is now a full-fledged expression that can finally be evaluated by
-          another function call invocation. A second function call will invoke the
-          actual <code class="computeroutput"><span class="identifier">foo</span></code> function. Example:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)(</span><span class="number">4</span><span class="special">);</span>
-</pre>
-<p>
-          will print out "4".
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_function_objects.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,72 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Member Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_functions.html" title="Binding Functions">
-<link rel="next" href="binding_member_variables.html" title="Binding Member Variables">
-</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="binding_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_variables.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_member_functions"></a><a class="link" href="binding_member_functions.html" title="Binding Member Functions">Binding
-        Member Functions</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Binding member functions can be done similarly. A bound member function
-          takes in a pointer or reference to an object as the first argument. For
-          instance, given:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">xyz</span>
-<span class="special">{</span>
-    <span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">xyz</span></code>'s <code class="computeroutput"><span class="identifier">foo</span></code>
-          member function can be bound as:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// obj is an xyz object</span>
-</pre>
-<p>
-          Take note that a lazy-member functions expects the first argument to be
-          a pointer or reference to an object. Both the object (reference or pointer)
-          and the arguments can be lazily bound. Examples:
-        </p>
-<pre class="programlisting"><span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>     <span class="comment">// arg1.foo(arg2)</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>      <span class="comment">// obj.foo(arg1)</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="number">100</span><span class="special">)</span>       <span class="comment">// obj.foo(100)</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_variables.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,74 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Member Variables</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_member_functions.html" title="Binding Member Functions">
-<link rel="next" href="compatibility_with_boost_bind.html" title="Compatibility with Boost.Bind">
-</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="binding_member_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compatibility_with_boost_bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_member_variables"></a><a class="link" href="binding_member_variables.html" title="Binding Member Variables">Binding
-        Member Variables</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Member variables can also be bound much like member functions. Member variables
-          are not functions. Yet, like the <a class="link" href="../core/references.html" title="References"><code class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code></a>
-          that acts like a nullary function returning a reference to the data, member
-          variables, when bound, act like a unary function, taking in a pointer or
-          reference to an object as its argument and returning a reference to the
-          bound member variable. For instance, given:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">xyz</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">v</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span></code> can be bound as:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span> <span class="comment">// obj is an xyz object</span>
-</pre>
-<p>
-          As noted, just like the bound member function, a bound member variable
-          also expects the first (and only) argument to be a pointer or reference
-          to an object. The object (reference or pointer) can be lazily bound. Examples:
-        </p>
-<pre class="programlisting"><span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>             <span class="comment">// arg1.v</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span>              <span class="comment">// obj.v</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)(</span><span class="identifier">obj</span><span class="special">)</span> <span class="special">=</span> <span class="number">4</span>    <span class="comment">// obj.v = 4</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_member_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compatibility_with_boost_bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Compatibility with Boost.Bind</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_member_variables.html" title="Binding Member Variables">
-<link rel="next" href="../stl.html" title="STL">
-</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="binding_member_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../stl.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.compatibility_with_boost_bind"></a><a class="link" href="compatibility_with_boost_bind.html" title="Compatibility with Boost.Bind">Compatibility
-        with Boost.Bind</a>
-</h4></div></div></div>
-<p>
-          <code class="computeroutput"><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">bind</span></code> passes all testcases of the Boost.Bind
-          library. It is therefore completely compatible and interchangeable.
-        </p>
-<p>
-          Given the compatibility with Boost.Bind, we also assume compatibility with
-          std::tr1::bind and std::bind from the upcoming C++0x standard.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_member_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../stl.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,59 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Core</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="../modules.html" title="Modules">
-<link rel="next" href="core/values.html" title="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="../modules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="core/values.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.core"></a><a class="link" href="core.html" title="Core">Core</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Nothing</span></dt>
-</dl></div>
-<p>
-        Actors are composed to create more complex actors in a tree-like hierarchy.
-        The primitives are atomic entities that are like the leaves in the tree.
-        Phoenix is extensible. New primitives can be added anytime. Right out of
-        the box, there are only a few primitives, these are all defined in the Core
-        module.
-      </p>
-<p>
-        This section shall deal with these preset primitives.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../modules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="core/values.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,194 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Arguments</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="references.html" title="References">
-<link rel="next" href="nothing.html" title="Nothing">
-</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="references.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nothing.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.arguments"></a><a class="link" href="arguments.html" title="Arguments">Arguments</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">argument</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          We use an instance of:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          to represent the Nth function argument. The argument placeholder acts as
-          an imaginary data-bin where a function argument will be placed.
-        </p>
-<h6>
-<a name="phoenix.modules.core.arguments.h0"></a>
-          <span><a name="phoenix.modules.core.arguments.predefined_arguments"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.predefined_arguments">Predefined
-          Arguments</a>
-        </h6>
-<p>
-          There are a few predefined instances of <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          named <code class="computeroutput"><span class="identifier">arg1</span></code>..<code class="computeroutput"><span class="identifier">argN</span></code>, and its BLL
-          counterpart <code class="computeroutput"><span class="identifier">_1</span></code>..<code class="computeroutput"><span class="identifier">_N</span></code>. (where N is a predefined maximum).
-        </p>
-<p>
-          Here are some sample preset definitions of <code class="computeroutput"><span class="identifier">arg1</span></code>..<code class="computeroutput"><span class="identifier">argN</span></code>
-        </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">placeholders</span>
-<span class="special">{</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">arg1</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">arg2</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">3</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">arg3</span> <span class="special">=</span> <span class="special">{};</span>
-<span class="special">}</span>
-</pre>
-<p>
-          and its BLL
-          <code class="computeroutput"><span class="identifier">_1</span></code>..<code class="computeroutput"><span class="identifier">_N</span></code>
-          style counterparts:
-        </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">placeholders</span>
-<span class="special">{</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">_1</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">_2</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">3</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">_3</span> <span class="special">=</span> <span class="special">{};</span>
-<span class="special">}</span>
-</pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ARG_LIMIT</span></code>,
-            the predefined maximum placeholder index. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ARG_LIMIT</span></code>
-            is set to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-            (See <a class="link" href="../../actor.html" title="Actor">Actor</a>).
-          </p></td></tr>
-</table></div>
-<h6>
-<a name="phoenix.modules.core.arguments.h1"></a>
-          <span><a name="phoenix.modules.core.arguments.user_defined_arguments"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.user_defined_arguments">User Defined
-          Arguments</a>
-        </h6>
-<p>
-          When appropriate, you can define your own <code class="computeroutput"><span class="identifier">argument</span></code>
-          names. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">x</span><span class="special">;</span> <span class="comment">// note one based index</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">x</span></code> may now be used as a
-          parameter to a lazy function:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<p>
-          which is equivalent to:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.core.arguments.h2"></a>
-          <span><a name="phoenix.modules.core.arguments.evaluating_an_argument"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.evaluating_an_argument">Evaluating
-          an Argument</a>
-        </h6>
-<p>
-          An argument, when evaluated, selects the Nth argument from the those passed
-          in by the client.
-        </p>
-<p>
-          For example:
-        </p>
-<pre class="programlisting"><span class="keyword">char</span>        <span class="identifier">c</span> <span class="special">=</span> <span class="char">'A'</span><span class="special">;</span>
-<span class="keyword">int</span>         <span class="identifier">i</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
-<span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>        <span class="comment">//  Get the 1st argument: c</span>
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>     <span class="comment">//  Get the 1st argument: i</span>
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg2</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>     <span class="comment">//  Get the 2nd argument: s</span>
-</pre>
-<p>
-          will print out:
-        </p>
-<pre class="programlisting"><span class="identifier">A</span>
-<span class="number">123</span>
-<span class="identifier">Hello</span> <span class="identifier">World</span>
-</pre>
-<h6>
-<a name="phoenix.modules.core.arguments.h3"></a>
-          <span><a name="phoenix.modules.core.arguments.extra_arguments"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.extra_arguments">Extra
-          Arguments</a>
-        </h6>
-<p>
-          In C and C++, a function can have extra arguments that are not at all used
-          by the function body itself. These extra arguments are simply ignored.
-        </p>
-<p>
-          Phoenix also allows extra arguments to be passed. For example, recall our
-          original <code class="computeroutput"><span class="identifier">add</span></code> function:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
-</pre>
-<p>
-          We know now that partially applying this function results to a function
-          that expects 2 arguments. However, the library is a bit more lenient and
-          allows the caller to supply more arguments than is actually required. Thus,
-          <code class="computeroutput"><span class="identifier">add</span></code> actually allows 2
-          <span class="emphasis"><em>or more</em></span> arguments. For instance, with:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">,</span> <span class="identifier">z</span><span class="special">)</span>
-</pre>
-<p>
-          the third argument <code class="computeroutput"><span class="identifier">z</span></code> is
-          ignored. Taking this further, in-between arguments are also ignored. Example:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg5</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">,</span> <span class="identifier">e</span><span class="special">)</span>
-</pre>
-<p>
-          Here, arguments b, c, and d are ignored. The function <code class="computeroutput"><span class="identifier">add</span></code>
-          takes in the first argument (<code class="computeroutput"><span class="identifier">arg1</span></code>)
-          and the fifth argument (<code class="computeroutput"><span class="identifier">arg5</span></code>).
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            There are a few reasons why enforcing strict arity is not desirable.
-            A case in point is the callback function. Typical callback functions
-            provide more information than is actually needed. Lambda functions are
-            often used as callbacks.
-          </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="references.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nothing.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Nothing</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="arguments.html" title="Arguments">
-<link rel="next" href="../function.html" title="Function">
-</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="arguments.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../function.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.nothing"></a><a class="link" href="nothing.html" title="Nothing">Nothing</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">nothing</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Finally, the <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          does nothing; (a "bum", if you will :-) ). There's a sole <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span></code> instance named "nothing".
-          This actor is actually useful in situations where we don't want to do anything.
-          (See <a class="link" href="../statement/for_statement.html" title="for_ Statement">for_ Statement</a>
-          for example).
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="arguments.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../function.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/references.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,116 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="values.html" title="Values">
-<link rel="next" href="arguments.html" title="Arguments">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.references"></a><a class="link" href="references.html" title="References">References</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">reference</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Values are immutable constants. Attempting to modify a value will result
-          in a compile time error. When we want the function to modify the parameter,
-          we use a reference instead. For instance, imagine a lazy function <code class="computeroutput"><span class="identifier">add_assign</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">y</span><span class="special">)</span> <span class="special">{</span> <span class="identifier">x</span> <span class="special">+=</span> <span class="identifier">y</span><span class="special">;</span> <span class="special">}</span> <span class="comment">// pseudo code</span>
-</pre>
-<p>
-          Here, we want the first function argument, x, to be mutable. Obviously,
-          we cannot write:
-        </p>
-<pre class="programlisting"><span class="identifier">add_assign</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span> <span class="comment">// error first argument is immutable</span>
-</pre>
-<p>
-          In C++, we can pass in a reference to a variable as the first argument
-          in our example above. Yet, by default, the library forces arguments passed
-          to partially applied functions to be immutable values (see <a class="link" href="values.html" title="Values">Values</a>).
-          To achieve our intent, we use:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          This is similar to <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          before but instead holds a reference to a variable.
-        </p>
-<p>
-          We normally don't instantiate <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          objects directly. Instead we use:
-        </p>
-<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">v</span><span class="special">)</span>
-</pre>
-<p>
-          For example (where <code class="computeroutput"><span class="identifier">i</span></code> is
-          an <code class="computeroutput"><span class="keyword">int</span></code> variable):
-        </p>
-<pre class="programlisting"><span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">),</span> <span class="number">2</span><span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.core.references.h0"></a>
-          <span><a name="phoenix.modules.core.references.evaluating_a_reference"></a></span><a class="link" href="references.html#phoenix.modules.core.references.evaluating_a_reference">Evaluating
-          a Reference</a>
-        </h6>
-<p>
-          References are actors. Hence, references can be evaluated. Such invocation
-          gives the reference's identity. Example:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)()</span> <span class="special">&lt;&lt;</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">s</span><span class="special">)();</span>
-</pre>
-<p>
-          prints out "3 Hello World"
-        </p>
-<h6>
-<a name="phoenix.modules.core.references.h1"></a>
-          <span><a name="phoenix.modules.core.references.constant_references"></a></span><a class="link" href="references.html#phoenix.modules.core.references.constant_references">Constant
-          References</a>
-        </h6>
-<p>
-          Another free function
-        </p>
-<pre class="programlisting"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span>
-</pre>
-<p>
-          may also be used. <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code>
-          creates an <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          object. This is similar to <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          but when the data to be passed as argument to a function is heavy and expensive
-          to copy by value, the <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code>
-          offers a lighter alternative.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/core/values.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,84 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Values</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="../core.html" title="Core">
-<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="../core.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.values"></a><a class="link" href="values.html" title="Values">Values</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">value</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Whenever we see a constant in a partially applied function, an
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          (where T is the type of the constant) is automatically created for us.
-          For instance:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<p>
-          Passing a second argument, <code class="computeroutput"><span class="number">6</span></code>,
-          an <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is implicitly created behind the
-          scenes. This is also equivalent to <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">val</span><span class="special">(</span><span class="number">6</span><span class="special">))</span></code>.
-        </p>
-<pre class="programlisting"><span class="identifier">val</span><span class="special">(</span><span class="identifier">v</span><span class="special">)</span>
-</pre>
-<p>
-          generates an <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          where <code class="computeroutput"><span class="identifier">T</span></code> is the type of
-          <code class="computeroutput"><span class="identifier">x</span></code>. In most cases, there's
-          no need to explicitly use <code class="computeroutput"><span class="identifier">val</span></code>,
-          but, as we'll see later on, there are situations where this is unavoidable.
-        </p>
-<h3>
-<a name="phoenix.modules.core.values.h0"></a>
-          <span><a name="phoenix.modules.core.values.evaluating_a_value"></a></span><a class="link" href="values.html#phoenix.modules.core.values.evaluating_a_value">Evaluating
-          a Value</a>
-        </h3>
-<p>
-          Like arguments, values are also actors. As such, values can be evaluated.
-          Invoking a value gives the value's identity. Example:
-        </p>
-<pre class="programlisting"><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"Hello World"</span><span class="special">)();</span>
-</pre>
-<p>
-          prints out "3 Hello World".
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../core.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,150 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Function</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="core/nothing.html" title="Nothing">
-<link rel="next" href="function/adapting_functions.html" title="Adapting Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="core/nothing.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="function/adapting_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.function"></a><a class="link" href="function.html" title="Function">Function</a>
-</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="function/adapting_functions.html">Adapting
-        Functions</a></span></dt></dl></div>
-<p>
-        The <code class="computeroutput"><span class="identifier">function</span></code> class template
-        provides a mechanism for implementing lazily evaluated functions. Syntactically,
-        a lazy function looks like an ordinary C/C++ function. The function call
-        looks familiar and feels the same as ordinary C++ functions. However, unlike
-        ordinary functions, the actual function execution is deferred.
-      </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-        Unlike ordinary function pointers or functor objects that need to be explicitly
-        bound through the bind function (see <a class="link" href="bind.html" title="Bind">Bind</a>),
-        the argument types of these functions are automatically lazily bound.
-      </p>
-<p>
-        In order to create a lazy function, we need to implement a model of the
-        <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> concept. For a function that takes <code class="computeroutput"><span class="identifier">N</span></code> arguments, a model of <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> must provide:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            An <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>
-            that takes <code class="computeroutput"><span class="identifier">N</span></code> arguments,
-            and implements the function logic. This is also true for ordinary function
-            pointers.
-          </li>
-<li class="listitem">
-            A nested metafunction <code class="computeroutput"><span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">Signature</span><span class="special">&gt;</span></code> or nested typedef <code class="computeroutput"><span class="identifier">result_type</span></code>,
-            following the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> Protocol
-          </li>
-</ul></div>
-<p>
-        For example, the following type implements the FunctionEval concept, in order
-        to provide a lazy factorial function:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">factorial_impl</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">Arg</span> <span class="keyword">const</span> <span class="special">&amp;)&gt;</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="identifier">Arg</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">&gt;</span>
-    <span class="identifier">Arg</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Arg</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">n</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="special">(</span><span class="identifier">n</span> <span class="special">&lt;=</span> <span class="number">0</span><span class="special">)</span> <span class="special">?</span> <span class="number">1</span> <span class="special">:</span> <span class="identifier">n</span> <span class="special">*</span> <span class="special">(*</span><span class="keyword">this</span><span class="special">)(</span><span class="identifier">n</span><span class="special">-</span><span class="number">1</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-</pre>
-<p>
-        (See factorial.cpp)
-      </p>
-<p>
-        Having implemented the <code class="computeroutput"><span class="identifier">factorial_impl</span></code>
-        type, we can declare and instantiate a lazy <code class="computeroutput"><span class="identifier">factorial</span></code>
-        function this way:
-      </p>
-<pre class="programlisting"><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">factorial_impl</span><span class="special">&gt;</span> <span class="identifier">factorial</span><span class="special">;</span>
-</pre>
-<p>
-        Invoking a lazy function such as <code class="computeroutput"><span class="identifier">factorial</span></code>
-        does not immediately execute the function object <code class="computeroutput"><span class="identifier">factorial_impl</span></code>.
-        Instead, an <a class="link" href="../actor.html" title="Actor">actor</a> object is created
-        and returned to the caller. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-</pre>
-<p>
-        does nothing more than return an actor. A second function call will invoke
-        the actual factorial function. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)(</span><span class="number">4</span><span class="special">);</span>
-</pre>
-<p>
-        will print out "24".
-      </p>
-<p>
-        Take note that in certain cases (e.g. for function objects with state), an
-        instance of the model of <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> may be passed on to the constructor. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">factorial_impl</span><span class="special">&gt;</span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">ftor</span><span class="special">);</span>
-</pre>
-<p>
-        where ftor is an instance of factorial_impl (this is not necessary in this
-        case as <code class="computeroutput"><span class="identifier">factorial_impl</span></code> does
-        not require any state).
-      </p>
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../../doc/src/images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Take care though when using function objects with state because they are
-          often copied repeatedly, and state may change in one of the copies, rather
-          than the original.
-        </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="core/nothing.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="function/adapting_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,370 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Adapting Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../function.html" title="Function">
-<link rel="prev" href="../function.html" title="Function">
-<link rel="next" href="../operator.html" title="Operator">
-</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="../function.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../function.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../operator.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.function.adapting_functions"></a><a class="link" href="adapting_functions.html" title="Adapting Functions">Adapting
-        Functions</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span></dt>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_FUNCTION</span></dt>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span></dt>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_CALLABLE</span></dt>
-</dl></div>
-<p>
-          If you want to adapt already existing functions or function objects it
-          will become a repetetive task. Therefor the following boilerplate macros
-          are provided to help you adapt already exsiting functions, thus reducing
-          the need to <a class="link" href="../bind.html" title="Bind">phoenix.modules.bind</a>
-          functions.
-        </p>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary" title="BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary nullary function a lazy function.
-          </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-              These macros generate no global objects. The resulting lazy functions
-              are real functions that create the lazy function expression object
-            </p></td></tr>
-</table></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span><span class="special">(</span>
-    <span class="identifier">RETURN_TYPE</span>
-  <span class="special">,</span> <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to have a nullary lazy function
-            <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which calls
-            the nullary <code class="computeroutput"><span class="identifier">FUNCTION</span></code>
-            that has the return type <code class="computeroutput"><span class="identifier">RETURN_TYPE</span></code>
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">foo</span><span class="special">()</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="number">42</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">foo</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">foo</span><span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">placeholders</span><span class="special">::</span><span class="identifier">_1</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">((</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">foo</span><span class="special">())(</span><span class="number">1</span><span class="special">)</span> <span class="special">==</span> <span class="number">43</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function" title="BOOST_PHOENIX_ADAPT_FUNCTION">BOOST_PHOENIX_ADAPT_FUNCTION</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary function a lazy function.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span><span class="special">(</span>
-    <span class="identifier">RETURN_TYPE</span>
-  <span class="special">,</span> <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION_ARITY</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to have a lazy function
-            <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which calls
-            <code class="computeroutput"><span class="identifier">FUNCTION</span></code> that has the
-            return type <code class="computeroutput"><span class="identifier">RETURN_TYPE</span></code>
-            with <code class="computeroutput"><span class="identifier">FUNCTION_ARITY</span></code> number
-            of arguments.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">plus</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">b</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span><span class="special">;</span>
-    <span class="special">}</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-    <span class="identifier">T</span>
-    <span class="identifier">plus</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">c</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="identifier">c</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">plus</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span><span class="special">(</span>
-    <span class="keyword">typename</span> <span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;::</span><span class="identifier">type</span>
-  <span class="special">,</span> <span class="identifier">plus</span>
-  <span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span>
-  <span class="special">,</span> <span class="number">3</span>
-<span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg1</span><span class="special">;</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg2</span><span class="special">;</span>
-
-    <span class="keyword">int</span> <span class="identifier">a</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
-    <span class="keyword">int</span> <span class="identifier">b</span> <span class="special">=</span> <span class="number">256</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">);</span>
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">,</span> <span class="number">3</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">3</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary" title="BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary nullary function object a lazy function.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span><span class="special">(</span>
-    <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">CALLABLE</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to create <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which creates a lazy
-            function object that represents a nullary call to <code class="computeroutput"><span class="identifier">CALLABLE</span></code>.
-            The return type is specified by <code class="computeroutput"><span class="identifier">CALLABLE</span></code>
-            conforming to the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> protocol.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_callable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">foo</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">int</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-        <span class="identifier">result_type</span> <span class="keyword">operator</span><span class="special">()()</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="number">42</span><span class="special">;</span>
-        <span class="special">}</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span><span class="special">(</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">foo</span><span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">placeholders</span><span class="special">::</span><span class="identifier">_1</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">((</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">foo</span><span class="special">())(</span><span class="number">1</span><span class="special">)</span> <span class="special">==</span> <span class="number">43</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable" title="BOOST_PHOENIX_ADAPT_CALLABLE">BOOST_PHOENIX_ADAPT_CALLABLE</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary function object a lazy function.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span><span class="special">(</span>
-    <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION_NAME</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION_ARITY</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to create <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which creates a lazy
-            function object that represents a call to <code class="computeroutput"><span class="identifier">CALLABLE</span></code>
-            with <code class="computeroutput"><span class="identifier">FUNCTION_ARITY</span></code> arguments.
-            The return type is specified by <code class="computeroutput"><span class="identifier">CALLABLE</span></code>
-            conforming to the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> protocol.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_callable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">plus</span>
-    <span class="special">{</span>
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-        <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-        <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span><span class="special">)&gt;</span>
-            <span class="special">:</span> <span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span>
-        <span class="special">{};</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A2</span><span class="special">&gt;</span>
-        <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span><span class="special">,</span> <span class="identifier">A2</span><span class="special">)&gt;</span>
-            <span class="special">:</span> <span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span>
-        <span class="special">{};</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-        <span class="identifier">A0</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="identifier">a0</span> <span class="special">+</span> <span class="identifier">a1</span><span class="special">;</span>
-        <span class="special">}</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A2</span><span class="special">&gt;</span>
-        <span class="identifier">A0</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span><span class="special">,</span> <span class="identifier">A2</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a2</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="identifier">a0</span> <span class="special">+</span> <span class="identifier">a1</span> <span class="special">+</span> <span class="identifier">a2</span><span class="special">;</span>
-        <span class="special">}</span>
-    <span class="special">};</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span><span class="special">(</span><span class="identifier">plus</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span><span class="special">(</span><span class="identifier">plus</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="number">3</span><span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg1</span><span class="special">;</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg2</span><span class="special">;</span>
-
-    <span class="keyword">int</span> <span class="identifier">a</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
-    <span class="keyword">int</span> <span class="identifier">b</span> <span class="special">=</span> <span class="number">256</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">);</span>
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">,</span> <span class="number">3</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">3</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../function.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../function.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../operator.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,55 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Object</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="statement/throw_.html" title="throw_">
-<link rel="next" href="object/construction.html" title="Construction">
-</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="statement/throw_.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="object/construction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.object"></a><a class="link" href="object.html" title="Object">Object</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section">New</span></dt>
-<dt><span class="section">Delete</span></dt>
-<dt><span class="section">Casts</span></dt>
-</dl></div>
-<p>
-        The Object module deals with object construction, destruction and conversion.
-        The module provides <span class="emphasis"><em>"lazy"</em></span> versions of C++'s
-        object constructor, <code class="computeroutput"><span class="keyword">new</span></code>, <code class="computeroutput"><span class="keyword">delete</span></code>, <code class="computeroutput"><span class="keyword">static_cast</span></code>,
-        <code class="computeroutput"><span class="keyword">dynamic_cast</span></code>, <code class="computeroutput"><span class="keyword">const_cast</span></code> and <code class="computeroutput"><span class="keyword">reinterpret_cast</span></code>.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="statement/throw_.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="object/construction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,71 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Casts</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="delete.html" title="Delete">
-<link rel="next" href="../scope.html" title="Scope">
-</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="delete.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../scope.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.casts"></a><a class="link" href="casts.html" title="Casts">Casts</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy casts...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">static_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">dynamic_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">const_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">reinterpret_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The set of lazy C++ cast template functions provide a way of lazily casting
-          an object of a certain type to another type. The syntax resembles the well
-          known C++ casts. Take note however that the lazy versions have a trailing
-          underscore.
-        </p>
-<pre class="programlisting"><span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-<span class="identifier">dynamic_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-<span class="identifier">const_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-<span class="identifier">reinterpret_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-</pre>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="identifier">Base</span><span class="special">*&gt;(&amp;</span><span class="identifier">arg1</span><span class="special">)</span>
-</pre>
-<p>
-          Static-casts the address of <code class="computeroutput"><span class="identifier">arg1</span></code>
-          to a <code class="computeroutput"><span class="identifier">Base</span><span class="special">*</span></code>.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="delete.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../scope.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Construction</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="../object.html" title="Object">
-<link rel="next" href="new.html" title="New">
-</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="../object.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.construction"></a><a class="link" href="construction.html" title="Construction">Construction</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy constructors...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="identifier">construct</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Lazily construct an object from an arbitrary set of arguments:
-        </p>
-<pre class="programlisting"><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
-</pre>
-<p>
-          where the given parameters are the parameters to the constructor of the
-          object of type T (This implies, that type T is expected to have a constructor
-          with a corresponding set of parameter types.).
-        </p>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
-</pre>
-<p>
-          Constructs a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> from <code class="computeroutput"><span class="identifier">arg1</span></code>
-          and <code class="computeroutput"><span class="identifier">arg2</span></code>.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            The maximum number of actual parameters is limited by the preprocessor
-            constant BOOST_PHOENIX_COMPOSITE_LIMIT. Note though, that this limit
-            should not be greater than BOOST_PHOENIX_LIMIT. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_COMPOSITE_LIMIT</span></code> is set
-            to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-            (See <a class="link" href="../../actor.html" title="Actor">Actor</a>).
-          </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../object.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,61 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Delete</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="new.html" title="New">
-<link rel="next" href="casts.html" title="Casts">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="new.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="casts.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.delete"></a><a class="link" href="delete.html" title="Delete">Delete</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy delete...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">delete</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Lazily delete an object, from the heap:
-        </p>
-<pre class="programlisting"><span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg</span><span class="special">);</span>
-</pre>
-<p>
-          where arg is assumed to be a pointer to an object.
-        </p>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">delete_</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// note the spelling of delete_ (with trailing underscore)</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="new.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="casts.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/object/new.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>New</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="construction.html" title="Construction">
-<link rel="next" href="delete.html" title="Delete">
-</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="construction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="delete.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.new"></a><a class="link" href="new.html" title="New">New</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy new...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">new</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Lazily construct an object, on the heap, from an arbitrary set of arguments:
-        </p>
-<pre class="programlisting"><span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
-</pre>
-<p>
-          where the given parameters are the parameters to the contractor of the
-          object of type T (This implies, that type T is expected to have a constructor
-          with a corresponding set of parameter types.).
-        </p>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// note the spelling of new_ (with trailing underscore)</span>
-</pre>
-<p>
-          Creates a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> from <code class="computeroutput"><span class="identifier">arg1</span></code>
-          and <code class="computeroutput"><span class="identifier">arg2</span></code> on the heap.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            The maximum number of actual parameters is limited by the preprocessor
-            constant BOOST_PHOENIX_COMPOSITE_LIMIT. Note though, that this limit
-            should not be greater than BOOST_PHOENIX_LIMIT. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_COMPOSITE_LIMIT</span></code> is set
-            to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-            (See <a class="link" href="../../actor.html" title="Actor">Actor</a>).
-          </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="construction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="delete.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/operator.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,368 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Operator</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="function/adapting_functions.html" title="Adapting Functions">
-<link rel="next" href="statement.html" title="Statement">
-</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="function/adapting_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.operator"></a><a class="link" href="operator.html" title="Operator">Operator</a>
-</h3></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-        This facility provides a mechanism for lazily evaluating operators. Syntactically,
-        a lazy operator looks and feels like an ordinary C/C++ infix, prefix or postfix
-        operator. The operator application looks the same. However, unlike ordinary
-        operators, the actual operator execution is deferred. Samples:
-      </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span>
-<span class="number">1</span> <span class="special">+</span> <span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg2</span>
-<span class="number">1</span> <span class="special">/</span> <span class="special">-</span><span class="identifier">arg1</span>
-<span class="identifier">arg1</span> <span class="special">&lt;</span> <span class="number">150</span>
-</pre>
-<p>
-        We have seen the lazy operators in action (see <a class="link" href="../starter_kit/lazy_operators.html" title="Lazy Operators">Quick
-        Start - Lazy Operators</a>). Let's go back and examine them a little bit
-        further:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-</pre>
-<p>
-        Through operator overloading, the expression <code class="computeroutput"><span class="identifier">arg1</span>
-        <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> actually
-        generates an actor. This actor object is passed on to STL's <code class="computeroutput"><span class="identifier">find_if</span></code> function. From the viewpoint of
-        STL, the expression is simply a function object expecting a single argument
-        of the containers value_type. For each element in <code class="computeroutput"><span class="identifier">c</span></code>,
-        the element is passed on as an argument <code class="computeroutput"><span class="identifier">arg1</span></code>
-        to the actor (function object). The actor checks if this is an odd value
-        based on the expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span>
-        <span class="number">1</span></code> where arg1 is replaced by the container's
-        element.
-      </p>
-<p>
-        Like lazy functions (see <a class="link" href="function.html" title="Function">Function</a>),
-        lazy operators are not immediately executed when invoked. Instead, an actor
-        (see <a class="link" href="../actor.html" title="Actor">Actor</a>) object is created and returned
-        to the caller. Example:
-      </p>
-<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span>
-</pre>
-<p>
-        does nothing more than return an actor. A second function call will evaluate
-        the actual operators. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">((</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span><span class="special">)(</span><span class="number">4</span><span class="special">,</span> <span class="number">5</span><span class="special">,</span> <span class="number">6</span><span class="special">);</span>
-</pre>
-<p>
-        will print out "54".
-      </p>
-<p>
-        Operator expressions are lazily evaluated following four simple rules:
-      </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-            A binary operator, except <code class="computeroutput"><span class="special">-&gt;*</span></code>
-            will be lazily evaluated when <span class="emphasis"><em>at least</em></span> one of its
-            operands is an actor object (see <a class="link" href="../actor.html" title="Actor">Actor</a>).
-          </li>
-<li class="listitem">
-            Unary operators are lazily evaluated if their argument is an actor object.
-          </li>
-<li class="listitem">
-            Operator <code class="computeroutput"><span class="special">-&gt;*</span></code> is lazily
-            evaluated if the left hand argument is an actor object.
-          </li>
-<li class="listitem">
-            The result of a lazy operator is an actor object that can in turn allow
-            the applications of rules 1, 2 and 3.
-          </li>
-</ol></div>
-<p>
-        For example, to check the following expression is lazily evaluated:
-      </p>
-<pre class="programlisting"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-            Following rule 1, <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></code> is
-            lazily evaluated since <code class="computeroutput"><span class="identifier">arg1</span></code>
-            is an actor (see <a class="link" href="core/arguments.html" title="Arguments">Arguments</a>).
-          </li>
-<li class="listitem">
-            The result of this <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></code> expression
-            is an actor object, following rule 4.
-          </li>
-<li class="listitem">
-            Continuing, <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
-            <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is again lazily evaluated. Rule 2.
-          </li>
-<li class="listitem">
-            By rule 4 again, the result of <code class="computeroutput"><span class="identifier">arg1</span>
-            <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is
-            an actor object.
-          </li>
-<li class="listitem">
-            As <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
-            <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is an actor, <code class="computeroutput"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span></code> is lazily evaluated. Rule 2.
-          </li>
-</ol></div>
-<p>
-        Lazy-operator application is highly contagious. In most cases, a single
-        <code class="computeroutput"><span class="identifier">argN</span></code> actor infects all its
-        immediate neighbors within a group (first level or parenthesized expression).
-      </p>
-<p>
-        Note that at least one operand of any operator must be a valid actor for
-        lazy evaluation to take effect. To force lazy evaluation of an ordinary expression,
-        we can use <code class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> or <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-        to transform an operand into a valid actor object (see <a class="link" href="core.html" title="Core">Core</a>).
-        For example:
-      </p>
-<pre class="programlisting"><span class="number">1</span> <span class="special">&lt;&lt;</span> <span class="number">3</span><span class="special">;</span>      <span class="comment">// Immediately evaluated</span>
-<span class="identifier">val</span><span class="special">(</span><span class="number">1</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="number">3</span><span class="special">;</span> <span class="comment">// Lazily evaluated</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h0"></a>
-        <span><a name="phoenix.modules.operator.supported_operators"></a></span><a class="link" href="operator.html#phoenix.modules.operator.supported_operators">Supported
-        operators</a>
-      </h5>
-<h5>
-<a name="phoenix.modules.operator.h1"></a>
-        <span><a name="phoenix.modules.operator.unary_operators"></a></span><a class="link" href="operator.html#phoenix.modules.operator.unary_operators">Unary
-        operators</a>
-      </h5>
-<pre class="programlisting"><span class="identifier">prefix</span><span class="special">:</span>   <span class="special">~,</span> <span class="special">!,</span> <span class="special">-,</span> <span class="special">+,</span> <span class="special">++,</span> <span class="special">--,</span> <span class="special">&amp;</span> <span class="special">(</span><span class="identifier">reference</span><span class="special">),</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">dereference</span><span class="special">)</span>
-<span class="identifier">postfix</span><span class="special">:</span>  <span class="special">++,</span> <span class="special">--</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h2"></a>
-        <span><a name="phoenix.modules.operator.binary_operators"></a></span><a class="link" href="operator.html#phoenix.modules.operator.binary_operators">Binary
-        operators</a>
-      </h5>
-<pre class="programlisting"><span class="special">=,</span> <span class="special">[],</span> <span class="special">+=,</span> <span class="special">-=,</span> <span class="special">*=,</span> <span class="special">/=,</span> <span class="special">%=,</span> <span class="special">&amp;=,</span> <span class="special">|=,</span> <span class="special">^=,</span> <span class="special">&lt;&lt;=,</span> <span class="special">&gt;&gt;=</span>
-<span class="special">+,</span> <span class="special">-,</span> <span class="special">*,</span> <span class="special">/,</span> <span class="special">%,</span> <span class="special">&amp;,</span> <span class="special">|,</span> <span class="special">^,</span> <span class="special">&lt;&lt;,</span> <span class="special">&gt;&gt;</span>
-<span class="special">==,</span> <span class="special">!=,</span> <span class="special">&lt;,</span> <span class="special">&gt;,</span> <span class="special">&lt;=,</span> <span class="special">&gt;=</span>
-<span class="special">&amp;&amp;,</span> <span class="special">||,</span> <span class="special">-&gt;*</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h3"></a>
-        <span><a name="phoenix.modules.operator.ternary_operator"></a></span><a class="link" href="operator.html#phoenix.modules.operator.ternary_operator">Ternary
-        operator</a>
-      </h5>
-<pre class="programlisting"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span>
-</pre>
-<p>
-        The ternary operator deserves special mention. Since C++ does not allow us
-        to overload the conditional expression: <code class="computeroutput"><span class="identifier">c</span>
-        <span class="special">?</span> <span class="identifier">a</span> <span class="special">:</span> <span class="identifier">b</span></code>, the
-        if_else pseudo function is provided for this purpose. The behavior is identical,
-        albeit in a lazy manner.
-      </p>
-<h5>
-<a name="phoenix.modules.operator.h4"></a>
-        <span><a name="phoenix.modules.operator.member_pointer_operator"></a></span><a class="link" href="operator.html#phoenix.modules.operator.member_pointer_operator">Member
-        pointer operator</a>
-      </h5>
-<pre class="programlisting"><span class="identifier">a</span><span class="special">-&gt;*</span><span class="identifier">member_object_pointer</span>
-<span class="identifier">a</span><span class="special">-&gt;*</span><span class="identifier">member_function_pointer</span>
-</pre>
-<p>
-        The left hand side of the member pointer operator must be an actor returning
-        a pointer type. The right hand side of the member pointer operator may be
-        either a pointer to member object or pointer to member function.
-      </p>
-<p>
-        If the right hand side is a member object pointer, the result is an actor
-        which, when evaluated, returns a reference to that member. For example:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">A</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">member</span><span class="special">;</span>
-<span class="special">};</span>
-
-<span class="identifier">A</span><span class="special">*</span> <span class="identifier">a</span> <span class="special">=</span> <span class="keyword">new</span> <span class="identifier">A</span><span class="special">;</span>
-<span class="special">...</span>
-
-<span class="special">(</span><span class="identifier">arg1</span><span class="special">-&gt;*&amp;</span><span class="identifier">A</span><span class="special">::</span><span class="identifier">member</span><span class="special">)(</span><span class="identifier">a</span><span class="special">);</span> <span class="comment">// returns member a-&gt;member</span>
-</pre>
-<p>
-        If the right hand side is a member function pointer, the result is an actor
-        which, when invoked, calls the specified member function. For example:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">A</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">func</span><span class="special">(</span><span class="keyword">int</span><span class="special">);</span>
-<span class="special">};</span>
-
-<span class="identifier">A</span><span class="special">*</span> <span class="identifier">a</span> <span class="special">=</span> <span class="keyword">new</span> <span class="identifier">A</span><span class="special">;</span>
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
-
-<span class="special">(</span><span class="identifier">arg1</span><span class="special">-&gt;*&amp;</span><span class="identifier">A</span><span class="special">::</span><span class="identifier">func</span><span class="special">)(</span><span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">i</span><span class="special">);</span> <span class="comment">// returns a-&gt;func(i)</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h5"></a>
-        <span><a name="phoenix.modules.operator.include_files"></a></span><a class="link" href="operator.html#phoenix.modules.operator.include_files">Include
-        Files</a>
-      </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Operators
-                </p>
-              </th>
-<th>
-                <p>
-                  File
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">-</span></code>, <code class="computeroutput"><span class="special">+</span></code>,
-                  <code class="computeroutput"><span class="special">++</span></code>, <code class="computeroutput"><span class="special">--</span></code>, <code class="computeroutput"><span class="special">+=</span></code>,
-                  <code class="computeroutput"><span class="special">-=</span></code>, <code class="computeroutput"><span class="special">*=</span></code>, <code class="computeroutput"><span class="special">/=</span></code>,
-                  <code class="computeroutput"><span class="special">%=</span></code>, <code class="computeroutput"><span class="special">*</span></code>, <code class="computeroutput"><span class="special">/</span></code>,
-                  <code class="computeroutput"><span class="special">%</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">arithmetic</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">&amp;=</span></code>, <code class="computeroutput"><span class="special">|=</span></code>, <code class="computeroutput"><span class="special">^=</span></code>,
-                  <code class="computeroutput"><span class="special">&lt;&lt;=</span></code>, <code class="computeroutput"><span class="special">&gt;&gt;=</span></code>, <code class="computeroutput"><span class="special">&amp;</span></code>,
-                  <code class="computeroutput"><span class="special">|</span></code>, <code class="computeroutput"><span class="special">^</span></code>,
-                  <code class="computeroutput"><span class="special">&lt;&lt;</span></code>, <code class="computeroutput"><span class="special">&gt;&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">bitwise</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">==</span></code>, <code class="computeroutput"><span class="special">!=</span></code>, <code class="computeroutput"><span class="special">&lt;</span></code>,
-                  <code class="computeroutput"><span class="special">&lt;=</span></code>, <code class="computeroutput"><span class="special">&gt;</span></code>, <code class="computeroutput"><span class="special">&gt;=</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">comparison</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">&lt;&lt;</span></code>, <code class="computeroutput"><span class="special">&gt;&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">io</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">!</span></code>, &amp;&amp;, <code class="computeroutput"><span class="special">||</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">logical</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">&amp;</span><span class="identifier">x</span></code>,
-                  <code class="computeroutput"><span class="special">*</span><span class="identifier">p</span></code>,
-                  <code class="computeroutput"><span class="special">=</span></code>, <code class="computeroutput"><span class="special">[]</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">self</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                  <span class="identifier">a</span><span class="special">,</span>
-                  <span class="identifier">b</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">if_else</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">-&gt;*</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">member</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="function/adapting_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,66 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Scope</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="object/casts.html" title="Casts">
-<link rel="next" href="scope/local_variables.html" title="Local Variables">
-</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="object/casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="scope/local_variables.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.scope"></a><a class="link" href="scope.html" title="Scope">Scope</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Local Variables</span></dt>
-<dt><span class="section">let</span></dt>
-<dt><span class="section">lambda</span></dt>
-</dl></div>
-<p>
-        Up until now, the most basic ingredient is missing: creation of and access
-        to local variables in the stack. When recursion comes into play, you will
-        soon realize the need to have true local variables. It may seem that we do
-        not need this at all since an unnamed lambda function cannot call itself
-        anyway; at least not directly. With some sort of arrangement, situations
-        will arise where a lambda function becomes recursive. A typical situation
-        occurs when we store a lambda function in a Boost.Function,
-        essentially naming the unnamed lambda.
-      </p>
-<p>
-        There will also be situations where a lambda function gets passed as an argument
-        to another function. This is a more common situation. In this case, the lambda
-        function assumes a new scope; new arguments and possibly new local variables.
-      </p>
-<p>
-        This section deals with local variables and nested lambda scopes.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="object/casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="scope/local_variables.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,194 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>lambda</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../scope.html" title="Scope">
-<link rel="prev" href="let.html" title="let">
-<link rel="next" href="../bind.html" title="Bind">
-</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="let.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.scope.lambda"></a><a class="link" href="lambda.html" title="lambda">lambda</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">lambda</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          A lot of times, you'd want to write a lazy function that accepts one or
-          more functions (higher order functions). STL algorithms come to mind, for
-          example. Consider a lazy version of <code class="computeroutput"><span class="identifier">stl</span><span class="special">::</span><span class="identifier">for_each</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">for_each_impl</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">F</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">void</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">F</span><span class="special">&gt;</span>
-    <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">C</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">F</span> <span class="identifier">f</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">f</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">for_each_impl</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">for_each</span> <span class="special">=</span> <span class="identifier">for_each_impl</span><span class="special">();</span>
-</pre>
-<p>
-          Notice that the function accepts another function, <code class="computeroutput"><span class="identifier">f</span></code>
-          as an argument. The scope of this function, <code class="computeroutput"><span class="identifier">f</span></code>,
-          is limited within the <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>. When <code class="computeroutput"><span class="identifier">f</span></code>
-          is called inside <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>, it exists in a new scope, along
-          with new arguments and, possibly, local variables. This new scope is not
-          at all related to the outer scopes beyond the <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>.
-        </p>
-<p>
-          Simple syntax:
-        </p>
-<pre class="programlisting"><span class="identifier">lambda</span>
-<span class="special">[</span>
-    <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">body</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Like <code class="computeroutput"><span class="identifier">let</span></code>, local variables
-          may be declared, allowing 1..N local variable declarations (where N ==
-          <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>):
-        </p>
-<pre class="programlisting"><span class="identifier">lambda</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">body</span>
-<span class="special">]</span>
-</pre>
-<p>
-          The same restrictions apply with regard to scope and visibility. The RHS
-          (right hand side lambda-expression) of each local-declaration cannot refer
-          to any LHS local-id. The local-ids are not in scope yet; they will be in
-          scope only in the lambda-body:
-        </p>
-<pre class="programlisting"><span class="identifier">lambda</span><span class="special">(</span>
-    <span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
-  <span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Error: _a is not in scope yet</span>
-<span class="special">)</span>
-</pre>
-<p>
-          See <a class="link" href="let.html#phoenix.modules.scope.let.visibility"><code class="computeroutput"><span class="identifier">let</span></code> Visibility</a> for more information.
-        </p>
-<p>
-          Example: Using our lazy <code class="computeroutput"><span class="identifier">for_each</span></code>
-          let's print all the elements in a container:
-        </p>
-<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">lambda</span><span class="special">[</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">])</span>
-</pre>
-<p>
-          As far as the arguments are concerned (arg1..argN), the scope in which
-          the lambda-body exists is totally new. The left <code class="computeroutput"><span class="identifier">arg1</span></code>
-          refers to the argument passed to <code class="computeroutput"><span class="identifier">for_each</span></code>
-          (a container). The right <code class="computeroutput"><span class="identifier">arg1</span></code>
-          refers to the argument passed by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>
-          when we finally get to call <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code> in our <code class="computeroutput"><span class="identifier">for_each_impl</span></code>
-          above (a container element).
-        </p>
-<p>
-          Yet, we may wish to get information from outer scopes. While we do not
-          have access to arguments in outer scopes, what we still have is access
-          to local variables from outer scopes. We may only be able to pass argument
-          related information from outer <code class="computeroutput"><span class="identifier">lambda</span></code>
-          scopes through the local variables.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            This is a crucial difference between <code class="computeroutput"><span class="identifier">let</span></code>
-            and <code class="computeroutput"><span class="identifier">lambda</span></code>: <code class="computeroutput"><span class="identifier">let</span></code> does not introduce new arguments;
-            <code class="computeroutput"><span class="identifier">lambda</span></code> does.
-          </p></td></tr>
-</table></div>
-<p>
-          Another example: Using our lazy <code class="computeroutput"><span class="identifier">for_each</span></code>,
-          and a lazy <code class="computeroutput"><span class="identifier">push_back</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">push_back_impl</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">void</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-    <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">C</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="identifier">c</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">x</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">push_back_impl</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">push_back</span> <span class="special">=</span> <span class="identifier">push_back_impl</span><span class="special">();</span>
-</pre>
-<p>
-          write a lambda expression that accepts:
-        </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-              a 2-dimensional container (e.g. <code class="computeroutput"><span class="identifier">vector</span><span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="special">&gt;</span></code>)
-            </li>
-<li class="listitem">
-              a container element (e.g. <code class="computeroutput"><span class="keyword">int</span></code>)
-            </li>
-</ol></div>
-<p>
-          and pushes-back the element to each of the <code class="computeroutput"><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span></code>.
-        </p>
-<p>
-          Solution:
-        </p>
-<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
-    <span class="identifier">lambda</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg2</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_a</span><span class="special">)</span>
-    <span class="special">]</span>
-<span class="special">)</span>
-</pre>
-<p>
-          Since we do not have access to the arguments of the outer scopes beyond
-          the lambda-body, we introduce a local variable <code class="computeroutput"><span class="identifier">_a</span></code>
-          that captures the second outer argument: <code class="computeroutput"><span class="identifier">arg2</span></code>.
-          Hence: _a = arg2. This local variable is visible inside the lambda scope.
-        </p>
-<p>
-          (See lambda.cpp)
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="let.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,182 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>let</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../scope.html" title="Scope">
-<link rel="prev" href="local_variables.html" title="Local Variables">
-<link rel="next" href="lambda.html" title="lambda">
-</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="local_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lambda.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.scope.let"></a><a class="link" href="let.html" title="let">let</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">let</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          You declare local variables using the syntax:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">let</span><span class="special">-</span><span class="identifier">body</span>
-<span class="special">]</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">let</span></code> allows 1..N local variable
-          declarations (where N == <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>).
-          Each declaration follows the form:
-        </p>
-<pre class="programlisting"><span class="identifier">local</span><span class="special">-</span><span class="identifier">id</span> <span class="special">=</span> <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">expression</span>
-</pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>,
-            the predefined maximum local variable declarations in a let expression.
-            By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>
-            is set to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>.
-          </p></td></tr>
-</table></div>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">123</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">_a</span> <span class="special">+</span> <span class="identifier">_b</span>
-<span class="special">]</span>
-</pre>
-<p>
-          <span class="bold"><strong>Reference Preservation</strong></span>
-        </p>
-<p>
-          The type of the local variable assumes the type of the lambda- expression.
-          Type deduction is reference preserving. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">_a</span></code> assumes the type of
-          <code class="computeroutput"><span class="identifier">arg1</span></code>: a reference to an
-          argument, while <code class="computeroutput"><span class="identifier">_b</span></code> has
-          type <code class="computeroutput"><span class="keyword">int</span></code>.
-        </p>
-<p>
-          Consider this:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
-
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">--</span><span class="identifier">_a</span> <span class="special">&lt;&lt;</span> <span class="char">' '</span>
-<span class="special">]</span>
-<span class="special">(</span><span class="identifier">i</span><span class="special">);</span>
-
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>
-</pre>
-<p>
-          the output of above is : 0 0
-        </p>
-<p>
-          While with this:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
-
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">val</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">))</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">--</span><span class="identifier">_a</span> <span class="special">&lt;&lt;</span> <span class="char">' '</span>
-<span class="special">]</span>
-<span class="special">(</span><span class="identifier">i</span><span class="special">);</span>
-
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>
-</pre>
-<p>
-          the output is : 0 1
-        </p>
-<p>
-          Reference preservation is necessary because we need to have L-value access
-          to outer lambda-scopes (especially the arguments). <code class="computeroutput"><span class="identifier">arg</span></code>s
-          and <code class="computeroutput"><span class="identifier">ref</span></code>s are L-values.
-          <code class="computeroutput"><span class="identifier">val</span></code>s are R-values.
-        </p>
-<p>
-          <span class="bold"><strong>Visibility</strong></span> <a name="phoenix.modules.scope.let.visibility"></a>
-        </p>
-<p>
-          The scope and lifetimes of the local variables is limited within the let-body.
-          <code class="computeroutput"><span class="identifier">let</span></code> blocks can be nested.
-          A local variable may hide an outer local variable. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_x</span> <span class="special">=</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">_y</span> <span class="special">=</span> <span class="string">", World"</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="comment">// _x here is an int: 1</span>
-
-    <span class="identifier">let</span><span class="special">(</span><span class="identifier">_x</span> <span class="special">=</span> <span class="string">"Hello"</span><span class="special">)</span> <span class="comment">// hides the outer _x</span>
-    <span class="special">[</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">_x</span> <span class="special">&lt;&lt;</span> <span class="identifier">_y</span> <span class="comment">// prints "Hello, World"</span>
-    <span class="special">]</span>
-<span class="special">]</span>
-</pre>
-<p>
-          The RHS (right hand side lambda-expression) of each local-declaration cannot
-          refer to any LHS local-id. At this point, the local-ids are not in scope
-          yet; they will only be in scope in the let-body. The code below is in error:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span>
-    <span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
-  <span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Error: _a is not in scope yet</span>
-<span class="special">)</span>
-<span class="special">[</span>
-    <span class="comment">// _a and _b's scope starts here</span>
-    <span class="comment">/*. body .*/</span>
-<span class="special">]</span>
-</pre>
-<p>
-          However, if an outer let scope is available, this will be searched. Since
-          the scope of the RHS of a local-declaration is the outer scope enclosing
-          the let, the RHS of a local-declaration can refer to a local variable of
-          an outer scope:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">let</span><span class="special">(</span>
-        <span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
-      <span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Ok. _a refers to the outer _a</span>
-    <span class="special">)</span>
-    <span class="special">[</span>
-        <span class="comment">/*. body .*/</span>
-    <span class="special">]</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="local_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lambda.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,69 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Local Variables</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../scope.html" title="Scope">
-<link rel="prev" href="../scope.html" title="Scope">
-<link rel="next" href="let.html" title="let">
-</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="../scope.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="let.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.scope.local_variables"></a><a class="link" href="local_variables.html" title="Local Variables">Local Variables</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">local_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          We use an instance of:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          to represent a local variable. The local variable acts as an imaginary
-          data-bin where a local, stack based data will be placed. <code class="computeroutput"><span class="identifier">Key</span></code> is an arbitrary type that is used
-          to identify the local variable. Example:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">size_key</span><span class="special">;</span>
-<span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">size_key</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">size</span><span class="special">;</span>
-</pre>
-<p>
-          <span class="bold"><strong>Predefined Local Variables</strong></span>
-        </p>
-<p>
-          There are a few predefined instances of <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          named <code class="computeroutput"><span class="identifier">_a</span></code>..<code class="computeroutput"><span class="identifier">_z</span></code> that you can already use. To make
-          use of them, simply use the <code class="computeroutput"><span class="keyword">namespace</span>
-          <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span><span class="special">;</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../scope.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="let.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,114 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Statement</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="operator.html" title="Operator">
-<link rel="next" href="statement/block_statement.html" title="Block Statement">
-</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="operator.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement/block_statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.statement"></a><a class="link" href="statement.html" title="Statement">Statement</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Block Statement</span></dt>
-<dt><span class="section">if_ Statement</span></dt>
-<dt><span class="section">if_else_ Statement</span></dt>
-<dt><span class="section"><a href="statement/switch__statement.html">switch_
-        Statement</a></span></dt>
-<dt><span class="section"><a href="statement/while__statement.html">while_
-        Statement</a></span></dt>
-<dt><span class="section">do_while_ Statement</span></dt>
-<dt><span class="section">for_ Statement</span></dt>
-<dt><span class="section"><a href="statement/try__catch__statement.html">try_
-        catch_ Statement</a></span></dt>
-<dt><span class="section">throw_</span></dt>
-</dl></div>
-<p>
-        <span class="bold"><strong><span class="emphasis"><em>Lazy statements...</em></span></strong></span>
-      </p>
-<p>
-        The expressions presented so far are sufficiently powerful to construct quite
-        elaborate structures. We have presented lazy-functions and lazy-operators.
-        How about lazy-statements? First, an appetizer:
-      </p>
-<p>
-        Print all odd-numbered contents of an STL container using <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>
-        (all_odds.cpp):
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="char">' '</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</pre>
-<p>
-        Huh? Is that valid C++? Read on...
-      </p>
-<p>
-        Yes, it is valid C++. The sample code above is as close as you can get to
-        the syntax of C++. This stylized C++ syntax differs from actual C++ code.
-        First, the <code class="computeroutput"><span class="keyword">if</span></code> has a trailing
-        underscore. Second, the block uses square brackets instead of the familiar
-        curly braces {}.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top">
-<p>
-          <span class="bold"><strong>C++ in C++?</strong></span>
-        </p>
-<p>
-          In as much as Spirit
-          attempts to mimic EBNF in C++, Phoenix attempts to mimic C++ in C++!!!
-        </p>
-</td></tr>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Unlike lazy functions and lazy operators, lazy statements always return
-          void.
-        </p></td></tr>
-</table></div>
-<p>
-        Here are more examples with annotations. The code almost speaks for itself.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="operator.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement/block_statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,73 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>do_while_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="while__statement.html" title="while_ Statement">
-<link rel="next" href="for_statement.html" title="for_ Statement">
-</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="while__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.___do_while_____statement"></a><a class="link" href="___do_while_____statement.html" title="do_while_ Statement">do_while_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">do_while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">do_</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-</pre>
-<p>
-          Again, take note that <code class="computeroutput"><span class="keyword">while</span></code>
-          has a leading dot and a trailing underscore: <code class="computeroutput"><span class="special">.</span><span class="identifier">while_</span></code>
-        </p>
-<p>
-          Example: This code is almost the same as the previous example above with
-          a slight twist in logic.
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">do_</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-        <span class="special">]</span>
-        <span class="special">.</span><span class="identifier">while_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">--),</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"\n"</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="while__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,88 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>if_else_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="if__statement.html" title="if_ Statement">
-<link rel="next" href="switch__statement.html" title="switch_ Statement">
-</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="if__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="switch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.___if_else_____statement"></a><a class="link" href="___if_else_____statement.html" title="if_else_ Statement">if_else_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is
-        </p>
-<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">else_</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Take note that <code class="computeroutput"><span class="keyword">else</span></code> has a
-          leading dot and a trailing underscore: <code class="computeroutput"><span class="special">.</span><span class="identifier">else_</span></code>
-        </p>
-<p>
-          Example: This code prints out all the elements and appends <code class="computeroutput"><span class="string">" &gt; 5"</span></code>, <code class="computeroutput"><span class="string">"
-          == 5"</span></code> or <code class="computeroutput"><span class="string">" &lt; 5"</span></code>
-          depending on the element's actual value:
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">&gt;</span> <span class="number">5</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">" &gt; 5\n"</span>
-    <span class="special">]</span>
-    <span class="special">.</span><span class="identifier">else_</span>
-    <span class="special">[</span>
-        <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">==</span> <span class="number">5</span><span class="special">)</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">" == 5\n"</span>
-        <span class="special">]</span>
-        <span class="special">.</span><span class="identifier">else_</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">" &lt; 5\n"</span>
-        <span class="special">]</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</pre>
-<p>
-          Notice how the <code class="computeroutput"><span class="identifier">if_else_</span></code>
-          statement is nested.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="if__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="switch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,91 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Block Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="../statement.html" title="Statement">
-<link rel="next" href="if__statement.html" title="if_ Statement">
-</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="../statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="if__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.block_statement"></a><a class="link" href="block_statement.html" title="Block Statement">Block Statement</a>
-</h4></div></div></div>
-<p>
-          Syntax:
-        </p>
-<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span>
-<span class="special">....</span>
-<span class="identifier">statement</span>
-</pre>
-<p>
-          Basically, these are comma separated statements. Take note that unlike
-          the C/C++ semicolon, the comma is a separator put <span class="bold"><strong>in-between</strong></span>
-          statements. This is like Pascal's semicolon separator, rather than C/C++'s
-          semicolon terminator. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span> <span class="comment">// ERROR!</span>
-</pre>
-<p>
-          Is an error. The last statement should not have a comma. Block statements
-          can be grouped using the parentheses. Again, the last statement in a group
-          should not have a trailing comma.
-        </p>
-<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span>
-<span class="special">(</span>
-    <span class="identifier">statement</span><span class="special">,</span>
-    <span class="identifier">statement</span>
-<span class="special">),</span>
-<span class="identifier">statement</span>
-</pre>
-<p>
-          Outside the square brackets, block statements should be grouped. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">do_this</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">),</span>
-        <span class="identifier">do_that</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</pre>
-<p>
-          Wrapping a comma operator chain around a parentheses pair blocks the interpretation
-          as an argument separator. The reason for the exception for the square bracket
-          operator is that the operator always takes exactly one argument, so it
-          "transforms" any attempt at multiple arguments with a comma operator
-          chain (and spits out an error for zero arguments).
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="if__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,81 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>for_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="___do_while_____statement.html" title="do_while_ Statement">
-<link rel="next" href="try__catch__statement.html" title="try_ catch_ Statement">
-</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="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="try__catch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.for_statement"></a><a class="link" href="for_statement.html" title="for_ Statement">for_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">for</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">for_</span><span class="special">(</span><span class="identifier">init_statement</span><span class="special">,</span> <span class="identifier">conditional_expression</span><span class="special">,</span> <span class="identifier">step_statement</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</pre>
-<p>
-          It is again very similar to the C++ for statement. Take note that the init_statement,
-          conditional_expression and step_statement are separated by the comma instead of the semi-colon
-          and each must be present (i.e. <code class="computeroutput"><span class="identifier">for_</span><span class="special">(,,)</span></code> is invalid). This is a case where the
-          <a class="link" href="../core/nothing.html" title="Nothing"><code class="computeroutput"><span class="identifier">nothing</span></code></a>
-          actor can be useful.
-        </p>
-<p>
-          Example: This code prints each element N times where N is the element's
-          value. A newline terminates the printout of each value.
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">iii</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">for_</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">)</span> <span class="special">&lt;</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="special">++</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">))</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-        <span class="special">],</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"\n"</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</pre>
-<p>
-          As before, all these are lazily evaluated. The result of such statements
-          are in fact expressions that are passed on to STL's for_each function.
-          In the viewpoint of <code class="computeroutput"><span class="identifier">for_each</span></code>,
-          what was passed is just a functor, no more, no less.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="try__catch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>if_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="block_statement.html" title="Block Statement">
-<link rel="next" href="___if_else_____statement.html" title="if_else_ Statement">
-</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="block_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.if__statement"></a><a class="link" href="if__statement.html" title="if_ Statement">if_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          We have seen the <code class="computeroutput"><span class="identifier">if_</span></code> statement.
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="block_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,74 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>switch_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="___if_else_____statement.html" title="if_else_ Statement">
-<link rel="next" href="while__statement.html" title="while_ Statement">
-</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="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="while__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.switch__statement"></a><a class="link" href="switch__statement.html" title="switch_ Statement">switch_
-        Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">switch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">switch_</span><span class="special">(</span><span class="identifier">integral_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">integral_value</span><span class="special">&gt;(</span><span class="identifier">sequenced_statements</span><span class="special">),</span>
-    <span class="special">...</span>
-    <span class="identifier">default_</span><span class="special">&lt;</span><span class="identifier">integral_value</span><span class="special">&gt;(</span><span class="identifier">sequenced_statements</span><span class="special">)</span>
-<span class="special">]</span>
-</pre>
-<p>
-          A comma separated list of cases, and an optional default can be provided.
-          Note unlike a normal switch statement, cases do not fall through.
-        </p>
-<p>
-          Example: This code prints out <code class="computeroutput"><span class="string">"one"</span></code>,
-          <code class="computeroutput"><span class="string">"two"</span></code> or <code class="computeroutput"><span class="string">"other value"</span></code> depending on the
-          element's actual value:
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">switch_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">case_</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"one"</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="char">'\n'</span><span class="special">),</span>
-        <span class="identifier">case_</span><span class="special">&lt;</span><span class="number">2</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"two"</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="char">'\n'</span><span class="special">),</span>
-        <span class="identifier">default_</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"other value"</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="char">'\n'</span><span class="special">)</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="while__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,84 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>throw_</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="try__catch__statement.html" title="try_ catch_ Statement">
-<link rel="next" href="../object.html" title="Object">
-</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="try__catch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../object.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.throw_"></a><a class="link" href="throw_.html" title="throw_">throw_</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">throw</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          As a natural companion to the try/catch support, the statement module provides
-          lazy throwing and re-throwing of exceptions.
-        </p>
-<p>
-          The syntax to throw an exception is:
-        </p>
-<pre class="programlisting"><span class="identifier">throw_</span><span class="special">(</span><span class="identifier">exception_expression</span><span class="special">)</span>
-</pre>
-<p>
-          The syntax to re-throw an exception is:
-        </p>
-<pre class="programlisting"><span class="identifier">throw_</span><span class="special">()</span>
-</pre>
-<p>
-          Example: This code extends the try/catch example, re-throwing exceptions
-          derived from runtime_error or exception, and translating other exception
-          types to runtime_errors.
-        </p>
-<pre class="programlisting"><span class="identifier">try_</span>
-<span class="special">[</span>
-    <span class="identifier">f</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">runtime_error</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught runtime error or derived\n"</span><span class="special">),</span>
-    <span class="identifier">throw_</span><span class="special">()</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">exception</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught exception or derived\n"</span><span class="special">),</span>
-    <span class="identifier">throw_</span><span class="special">()</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_all</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught some other type of exception\n"</span><span class="special">),</span>
-    <span class="identifier">throw_</span><span class="special">(</span><span class="identifier">runtime_error</span><span class="special">(</span><span class="string">"translated exception"</span><span class="special">))</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="try__catch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../object.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,89 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>try_ catch_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="for_statement.html" title="for_ Statement">
-<link rel="next" href="throw_.html" title="throw_">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="throw_.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.try__catch__statement"></a><a class="link" href="try__catch__statement.html" title="try_ catch_ Statement">try_
-        catch_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">try_catch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">try_</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">exception_type</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">...</span>
-<span class="special">.</span><span class="identifier">catch_all</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statement</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Note the usual underscore after try and catch, and the extra parentheses
-          required after the catch.
-        </p>
-<p>
-          Example: The following code calls the (lazy) function <code class="computeroutput"><span class="identifier">f</span></code>
-          for each element, and prints messages about different exception types it
-          catches.
-        </p>
-<pre class="programlisting"><span class="identifier">try_</span>
-<span class="special">[</span>
-    <span class="identifier">f</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">runtime_error</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught runtime error or derived\n"</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">exception</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught exception or derived\n"</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_all</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught some other type of exception\n"</span><span class="special">)</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="throw_.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,69 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>while_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="switch__statement.html" title="switch_ Statement">
-<link rel="next" href="___do_while_____statement.html" title="do_while_ Statement">
-</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="switch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.while__statement"></a><a class="link" href="while__statement.html" title="while_ Statement">while_
-        Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Example: This code decrements each element until it reaches zero and prints
-          out the number at each step. A newline terminates the printout of each
-          value.
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">while_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">--)</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-        <span class="special">],</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"\n"</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="switch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>STL</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="bind/compatibility_with_boost_bind.html" title="Compatibility with Boost.Bind">
-<link rel="next" href="stl/container.html" title="Container">
-</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="bind/compatibility_with_boost_bind.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stl/container.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.stl"></a><a class="link" href="stl.html" title="STL">STL</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Container</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-</dl></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-        This section summarizes the lazy equivalents of C++ Standard Library functionality
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="bind/compatibility_with_boost_bind.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stl/container.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,1141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Algorithm</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../stl.html" title="STL">
-<link rel="prev" href="container.html" title="Container">
-<link rel="next" href="../../inside.html" title="Inside Phoenix">
-</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="container.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../inside.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.stl.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The algorithm module provides wrappers for the standard algorithms in the
-          <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span></code> and <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">numeric</span><span class="special">&gt;</span></code>
-          headers.
-        </p>
-<p>
-          The algorithms are divided into the categories iteration, transformation
-          and querying, modeling the Boost.MPL
-          library. The different algorithm classes can be included using the headers:
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">iteration</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transformation</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">querying</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The functions of the algorithm module take ranges as arguments where appropriate.
-          This is different to the standard library, but easy enough to pick up.
-          Ranges are described in detail in the Boost.Range
-          library.
-        </p>
-<p>
-          For example, using the standard copy algorithm to copy between 2 arrays:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
-<span class="keyword">int</span> <span class="identifier">output</span><span class="special">[</span><span class="number">3</span><span class="special">];</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">array</span><span class="special">,</span> <span class="identifier">array</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">output</span><span class="special">);</span> <span class="comment">// We have to provide iterators</span>
-                                     <span class="comment">// to both the start and end of array</span>
-</pre>
-<p>
-          The analogous code using the phoenix algorithm module is:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
-<span class="keyword">int</span> <span class="identifier">output</span><span class="special">[</span><span class="number">3</span><span class="special">];</span>
-<span class="identifier">copy</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">array</span><span class="special">,</span> <span class="identifier">output</span><span class="special">);</span> <span class="comment">// Notice only 2 arguments, the end of</span>
-                                 <span class="comment">// array is established automatically</span>
-</pre>
-<p>
-          The Boost.Range
-          library provides support for standard containers, strings and arrays, and
-          can be extended to support additional types.
-        </p>
-<p>
-          The following tables describe the different categories of algorithms, and
-          their semantics.
-        </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-          <span class="inlinemediaobject"><img src="../../../images/tip.png" alt="tip"></span> Arguments in brackets denote optional parameters.
-        </p>
-</div>
-<div class="table">
-<a name="phoenix.modules.stl.algorithm.t0"></a><p class="title"><b>Table&#160;1.6.&#160;Iteration Algorithms</b></p>
-<div class="table-contents"><table class="table" summary="Iteration Algorithms">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    stl Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="table">
-<a name="phoenix.modules.stl.algorithm.t1"></a><p class="title"><b>Table&#160;1.7.&#160;Querying Algorithms</b></p>
-<div class="table-contents"><table class="table" summary="Querying Algorithms">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    stl Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="table">
-<a name="phoenix.modules.stl.algorithm.t2"></a><p class="title"><b>Table&#160;1.8.&#160;Transformation Algorithms</b></p>
-<div class="table-contents"><table class="table" summary="Transformation Algorithms">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    stl Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">i</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">,</span>
-                    <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">,</span>
-                    <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">m</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">m</span><span class="special">,</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">m</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">m</span><span class="special">,</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break">
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="container.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../inside.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,601 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Container</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../stl.html" title="STL">
-<link rel="prev" href="../stl.html" title="STL">
-<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="../stl.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.stl.container"></a><a class="link" href="container.html" title="Container">Container</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The container module predefines a set of lazy functions that work on STL
-          containers. These functions provide a mechanism for the lazy evaluation
-          of the public member functions of the STL containers. The lazy functions
-          are thin wrappers that simply forward to their respective counterparts
-          in the STL library.
-        </p>
-<p>
-          Lazy functions are provided for all of the member functions of the following
-          containers:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-              deque
-            </li>
-<li class="listitem">
-              list
-            </li>
-<li class="listitem">
-              map
-            </li>
-<li class="listitem">
-              multimap
-            </li>
-<li class="listitem">
-              vector
-            </li>
-</ul></div>
-<p>
-          Indeed, should your class have member functions with the same names and
-          signatures as those listed below, then it will automatically be supported.
-          To summarize, lazy functions are provided for member functions:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-              assign
-            </li>
-<li class="listitem">
-              at
-            </li>
-<li class="listitem">
-              back
-            </li>
-<li class="listitem">
-              begin
-            </li>
-<li class="listitem">
-              capacity
-            </li>
-<li class="listitem">
-              clear
-            </li>
-<li class="listitem">
-              empty
-            </li>
-<li class="listitem">
-              end
-            </li>
-<li class="listitem">
-              erase
-            </li>
-<li class="listitem">
-              front
-            </li>
-<li class="listitem">
-              get_allocator
-            </li>
-<li class="listitem">
-              insert
-            </li>
-<li class="listitem">
-              key_comp
-            </li>
-<li class="listitem">
-              max_size
-            </li>
-<li class="listitem">
-              pop_back
-            </li>
-<li class="listitem">
-              pop_front
-            </li>
-<li class="listitem">
-              push_back
-            </li>
-<li class="listitem">
-              push_front
-            </li>
-<li class="listitem">
-              rbegin
-            </li>
-<li class="listitem">
-              rend
-            </li>
-<li class="listitem">
-              reserve
-            </li>
-<li class="listitem">
-              resize
-            </li>
-<li class="listitem">
-              size
-            </li>
-<li class="listitem">
-              splice
-            </li>
-<li class="listitem">
-              value_comp
-            </li>
-</ul></div>
-<p>
-          The lazy functions' names are the same as the corresponding member function.
-          The difference is that the lazy functions are free functions and therefore
-          does not use the member "dot" syntax.
-        </p>
-<div class="table">
-<a name="phoenix.modules.stl.container.t0"></a><p class="title"><b>Table&#160;1.4.&#160;Sample usage</b></p>
-<div class="table-contents"><table class="table" summary="Sample usage">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    "Normal" version
-                  </p>
-                </th>
-<th>
-                  <p>
-                    "Lazy" version
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="number">5</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
-                    <span class="number">5</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">my_list</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">my_vector1</span><span class="special">.</span><span class="identifier">swap</span><span class="special">(</span><span class="identifier">my_vector2</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">swap</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
-                    <span class="identifier">arg2</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><p>
-          Notice that member functions with names that clash with stl algorithms
-          are absent. This will be provided in Phoenix's algorithm module.
-        </p>
-<p>
-          No support is provided here for lazy versions of <code class="computeroutput"><span class="keyword">operator</span><span class="special">+=</span></code>, <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> etc. Such operators are not specific
-          to STL containers and lazy versions can therefore be found in <a class="link" href="../operator.html" title="Operator">operators</a>.
-        </p>
-<p>
-          The following table describes the container functions and their semantics.
-        </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-          <span class="inlinemediaobject"><img src="../../../images/tip.png" alt="tip"></span> Arguments in brackets denote optional parameters.
-        </p>
-</div>
-<div class="table">
-<a name="phoenix.modules.stl.container.t1"></a><p class="title"><b>Table&#160;1.5.&#160;Lazy STL Container Functions</b></p>
-<div class="table-contents"><table class="table" summary="Lazy STL Container Functions">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">assign</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">back</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">capacity</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">clear</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">clear</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">erase</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">front</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">get_allocator</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">get_allocator</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">insert</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">key_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">key_comp</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">max_size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">max_size</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_back</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rend</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">resize</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">resize</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">splice</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">value_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">value_comp</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break">
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../stl.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/organization.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/organization.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,361 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Organization</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="basics.html" title="Basics">
-<link rel="next" href="actor.html" title="Actor">
-</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="basics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.organization"></a><a class="link" href="organization.html" title="Organization">Organization</a>
-</h2></div></div></div>
-<p>
-      Care and attention to detail was given, painstakingly, to the design and implementation
-      of Phoenix.
-    </p>
-<p>
-      The library is organized in four layers:
-    </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Actor
-        </li>
-<li class="listitem">
-          Value, Reference, Arguments
-        </li>
-<li class="listitem">
-          Function, Operator, Object, Statement, Scope
-        </li>
-<li class="listitem">
-          STL, Fusion, Bind
-        </li>
-</ol></div>
-<p>
-      The modules are orthogonal, with no cyclic dependencies. Lower layers do not
-      depend on higher layers. Modules in a layer do not depend on other modules
-      in the same layer. This means, for example, that Bind can be completely discarded
-      if it is not required; or one could perhaps take out Operator and Statement
-      and just use Function, which may be desirable in a pure FP application.
-    </p>
-<p>
-      The library has grown from the original Phoenix but still comprises only header
-      files. There are no object files to link against.
-    </p>
-<h3>
-<a name="phoenix.organization.h0"></a>
-      <span><a name="phoenix.organization.core"></a></span><a class="link" href="organization.html#phoenix.organization.core">Core</a>
-    </h3>
-<p>
-      The lowest two layers comprise the core.
-    </p>
-<p>
-      The <a class="link" href="actor.html" title="Actor"><code class="computeroutput"><span class="identifier">Actor</span></code></a>
-      is the main concept behind the library. Lazy functions are abstracted as actors.
-    </p>
-<p>
-      Terminals provide the basic building blocks of functionality within Phoenix.
-      Expressions are used to combine these terminals together to provide more powerful
-      functionality.
-    </p>
-<p>
-      Expressions are composed of zero or more actors. Each actor in a composite
-      can again be another expression.
-    </p>
-<div class="table">
-<a name="phoenix.organization.t0"></a><p class="title"><b>Table&#160;1.2.&#160;Modules</b></p>
-<div class="table-contents"><table class="table" summary="Modules">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-              <p>
-                Module
-              </p>
-            </th>
-<th>
-              <p>
-                Description
-              </p>
-            </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-              <p>
-                Function
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy functions support (e.g. <code class="computeroutput"><span class="identifier">add</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Operator
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy operators support (e.g. <code class="computeroutput"><span class="special">+</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Statement
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy statements (e.g. <code class="computeroutput"><span class="identifier">if_</span></code>,
-                <code class="computeroutput"><span class="identifier">while_</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Object
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy casts (e.g. <code class="computeroutput"><span class="identifier">static_cast_</span></code>),
-                object creation destruction (e.g. <code class="computeroutput"><span class="identifier">new_</span></code>,
-                <code class="computeroutput"><span class="identifier">delete_</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Scope
-              </p>
-            </td>
-<td>
-              <p>
-                Support for scopes, local variables and lambda-lambda
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Bind
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy functions from free functions, member functions or member variables.
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                STL Container
-              </p>
-            </td>
-<td>
-              <p>
-                Set of predefined "lazy" functions that work on STL containers
-                and sequences (e.g. <code class="computeroutput"><span class="identifier">push_back</span></code>).
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                STL Algorithm
-              </p>
-            </td>
-<td>
-              <p>
-                Set of predefined "lazy" versions of the STL algorithms
-                (e.g. <code class="computeroutput"><span class="identifier">find_if</span></code>).
-              </p>
-            </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><p>
-      Each module is defined in a header file with the same name. For example, the
-      core module is defined in <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>.
-    </p>
-<div class="table">
-<a name="phoenix.organization.t1"></a><p class="title"><b>Table&#160;1.3.&#160;Includes</b></p>
-<div class="table-contents"><table class="table" summary="Includes">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-              <p>
-                Module
-              </p>
-            </th>
-<th>
-              <p>
-                File
-              </p>
-            </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-              <p>
-                Core
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Function
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Operator
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Statement
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Object
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Scope
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Bind
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Container
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Algorithm
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="sidebar">
-<div class="titlepage"></div>
-<p>
-      <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Finer grained include files are available per feature;
-      see the succeeding sections.
-    </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="basics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/references.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,90 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="acknowledgments.html" title="Acknowledgments">
-</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="acknowledgments.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.references"></a><a class="link" href="references.html" title="References">References</a>
-</h2></div></div></div>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Why Functional Programming Matters, John Hughes, 1989. Available online
-          at http://www.math.chalmers.se/~rjmh/Papers/whyfp.html.
-        </li>
-<li class="listitem">
-          Boost.Lambda library, Jaakko Jarvi, 1999-2004 Jaakko Jarvi, Gary Powell.
-          Available online at http://www.boost.org/libs/lambda/.
-        </li>
-<li class="listitem">
-          Functional Programming in C++ using the FC++ Library: a short article introducing
-          FC++, Brian McNamara and Yannis Smaragdakis, August 2003. Available online
-          at http://www.cc.gatech.edu/~yannis/fc++/.
-        </li>
-<li class="listitem">
-          Side-effects and partial function application in C++, Jaakko Jarvi and
-          Gary Powell, 2001. Available online at http://osl.iu.edu/~jajarvi/publications/papers/mpool01.pdf.
-        </li>
-<li class="listitem">
-          Spirit Version 1.8.1, Joel de Guzman, Nov 2004. Available online at http://www.boost.org/libs/spirit/.
-        </li>
-<li class="listitem">
-          The Boost MPL Library, Aleksey Gurtovoy and David Abrahams, 2002-2004.
-          Available online at http://www.boost.org/libs/mpl/.
-        </li>
-<li class="listitem">
-          Generic Programming Redesign of Patterns, Proceedings of the 5th European
-          Conference on Pattern Languages of Programs, (EuroPLoP'2000) Irsee, Germany,
-          July 2000. Available online at http://www.coldewey.com/europlop2000/papers/geraud%2Bduret.zip.
-        </li>
-<li class="listitem">
-          A Gentle Introduction to Haskell, Paul Hudak, John Peterson and Joseph
-          Fasel, 1999. Available online at http://www.haskell.org/tutorial/.
-        </li>
-<li class="listitem">
-          Large scale software design, John Lackos, ISBN 0201633620, Addison-Wesley,
-          July 1996.
-        </li>
-<li class="listitem">
-          Design Patterns, Elements of Reusable Object-Oriented Software, Erich Gamma,
-          Richard Helm, Ralph Jhonson, and John Vlissides, Addison-Wesley, 1995.
-        </li>
-<li class="listitem">
-          The Forwarding Problem: Arguments Peter Dimov, Howard E. Hinnant, Dave
-          Abrahams, September 09, 2002. Available online: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
-          Function Problem</a>.
-        </li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="acknowledgments.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Starter Kit</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="introduction.html" title="Introduction">
-<link rel="next" href="starter_kit/values.html" title="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="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit/values.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.starter_kit"></a><a class="link" href="starter_kit.html" title="Starter Kit">Starter Kit</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Lazy Operators</span></dt>
-<dt><span class="section">Lazy Statements</span></dt>
-<dt><span class="section"><a href="starter_kit/construct__new__delete__casts.html">Construct,
-      New, Delete, Casts</a></span></dt>
-<dt><span class="section">Lazy Functions</span></dt>
-<dt><span class="section">More</span></dt>
-</dl></div>
-<p>
-      Most "quick starts" only get you a few blocks from where you are.
-      From there, you are on your own. Yet, typically, you'd want to get to the next
-      city. This starter kit shall be as minimal as possible, yet packed as much
-      power as possible.
-    </p>
-<p>
-      So you are busy and always on the go. You do not wish to spend a lot of time
-      studying the library. You wish to be spared the details for later when you
-      need it. For now, all you need to do is to get up to speed as quickly as possible
-      and start using the library. If this is the case, this is the right place to
-      start.
-    </p>
-<p>
-      This section is by no means a thorough discourse of the library. For more information
-      on Phoenix, please take some time to read the rest of the Documentation. Yet,
-      if you just want to use the library quickly, now, this chapter will probably
-      suffice. Rather than taking you to the details of the library, we shall try
-      to provide you with annotated examples instead. Hopefully, this will get you
-      into high gear quickly.
-    </p>
-<h4>
-<a name="phoenix.starter_kit.h0"></a>
-      <span><a name="phoenix.starter_kit.functors_everywhere"></a></span><a class="link" href="starter_kit.html#phoenix.starter_kit.functors_everywhere">Functors
-      everywhere</a>
-    </h4>
-<p>
-      Phoenix is built on function objects (functors). The functor is the main building
-      block. We compose functors to build more complex functors... to build more
-      complex functors... and so on. Almost everything is a functor.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        Functors are so ubiquitous in Phoenix that, in the manual, the words <span class="emphasis"><em>"functor"</em></span>
-        and <span class="emphasis"><em>"function"</em></span> are used interchangeably.
-      </p></td></tr>
-</table></div>
-<p>
-      We start with some core functions that are called <span class="bold"><strong>primitives</strong></span>.
-      You can think of primitives (such as values, references and arguments) as atoms.
-    </p>
-<p>
-      Things start to get interesting when we start <span class="emphasis"><em>composing</em></span>
-      primitives to form <span class="bold"><strong>expressions</strong></span>. The expressions
-      can, in turn, be composed to form even more complex expressions.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit/values.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,75 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Arguments</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="references.html" title="References">
-<link rel="next" href="lazy_operators.html" title="Lazy Operators">
-</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="references.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_operators.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.arguments"></a><a class="link" href="arguments.html" title="Arguments">Arguments</a>
-</h3></div></div></div>
-<p>
-        Arguments are also functions? You bet!
-      </p>
-<p>
-        Until now, we have been dealing with expressions returning a nullary function.
-        Arguments, on the other hand, evaluate to an N-ary function. An argument
-        represents the Nth argument. There are a few predefined arguments arg1, arg2,
-        arg3, arg4 and so on (and it's BLL
-        counterparts: _1, _2, _3, _4 and so on). Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="comment">// one-or-more argument function that returns its first argument</span>
-<span class="identifier">arg2</span> <span class="comment">// two-or-more argument function that returns its second argument</span>
-<span class="identifier">arg3</span> <span class="comment">// three-or-more argument function that returns its third argument</span>
-</pre>
-<p>
-        <code class="computeroutput"><span class="identifier">argN</span></code> returns the Nth argument.
-        Examples:
-      </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>        <span class="comment">// prints 3</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg2</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>     <span class="comment">// prints "Hello World"</span>
-</pre>
-<p>
-        (See arguments.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about arguments <a class="link" href="../modules/core/arguments.html" title="Arguments">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="references.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_operators.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,70 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Construct, New, Delete, Casts</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="lazy_statements.html" title="Lazy Statements">
-<link rel="next" href="lazy_functions.html" title="Lazy Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_statements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.construct__new__delete__casts"></a><a class="link" href="construct__new__delete__casts.html" title="Construct, New, Delete, Casts">Construct,
-      New, Delete, Casts</a>
-</h3></div></div></div>
-<p>
-        You'll probably want to work with objects. There are lazy versions of constructor
-        calls, <code class="computeroutput"><span class="keyword">new</span></code>, <code class="computeroutput"><span class="keyword">delete</span></code>
-        and the suite of C++ casts. Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>  <span class="comment">// constructs a std::string from arg1, arg2</span>
-<span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>       <span class="comment">// makes a new std::string from arg1, arg2</span>
-<span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>                       <span class="comment">// deletes arg1 (assumed to be a pointer)</span>
-<span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">*&gt;(</span><span class="identifier">arg1</span><span class="special">)</span>            <span class="comment">// static_cast's arg1 to an int*</span>
-</pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Take note that, by convention, names that conflict with C++ reserved words
-          are appended with a single trailing underscore <code class="computeroutput"><span class="char">'_'</span></code>
-        </p></td></tr>
-</table></div>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about this <a class="link" href="../modules/object.html" title="Object">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_statements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,109 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Lazy Functions</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="construct__new__delete__casts.html" title="Construct, New, Delete, Casts">
-<link rel="next" href="more.html" title="More">
-</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="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="more.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_functions"></a><a class="link" href="lazy_functions.html" title="Lazy Functions">Lazy Functions</a>
-</h3></div></div></div>
-<p>
-        As you write more lambda functions, you'll notice certain patterns that you
-        wish to refactor as reusable functions. When you reach that point, you'll
-        wish that ordinary functions can co-exist with phoenix functions. Unfortunately,
-        the <span class="emphasis"><em>immediate</em></span> nature of plain C++ functions make them
-        incompatible.
-      </p>
-<p>
-        Lazy functions are your friends. The library provides a facility to make
-        lazy functions. The code below is a rewrite of the <code class="computeroutput"><span class="identifier">is_odd</span></code>
-        function using the facility:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">is_odd_impl</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="keyword">bool</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Arg</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">is_odd_impl</span><span class="special">&gt;</span> <span class="identifier">is_odd</span><span class="special">;</span>
-</pre>
-<h5>
-<a name="phoenix.starter_kit.lazy_functions.h0"></a>
-        <span><a name="phoenix.starter_kit.lazy_functions.things_to_note_"></a></span><a class="link" href="lazy_functions.html#phoenix.starter_kit.lazy_functions.things_to_note_">Things
-        to note:</a>
-      </h5>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            Result type deduction is implemented with the help of the result_of protocol.
-            For more information see <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a>
-          </li>
-<li class="listitem">
-            <code class="computeroutput"><span class="identifier">is_odd_impl</span></code> implements
-            the function.
-          </li>
-<li class="listitem">
-            <code class="computeroutput"><span class="identifier">is_odd</span></code>, an instance of
-            <code class="computeroutput"><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">is_odd_impl</span><span class="special">&gt;</span></code>,
-            is the lazy function.
-          </li>
-</ul></div>
-<p>
-        Now, <code class="computeroutput"><span class="identifier">is_odd</span></code> is a truly lazy
-        function that we can use in conjunction with the rest of phoenix. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">is_odd</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">));</span>
-</pre>
-<p>
-        (See function.cpp)
-      </p>
-<h5>
-<a name="phoenix.starter_kit.lazy_functions.h1"></a>
-        <span><a name="phoenix.starter_kit.lazy_functions.predefined_lazy_functions"></a></span><a class="link" href="lazy_functions.html#phoenix.starter_kit.lazy_functions.predefined_lazy_functions">Predefined
-        Lazy Functions</a>
-      </h5>
-<p>
-        The library is chock full of STL savvy, predefined lazy functions covering
-        the whole of the STL containers, iterators and algorithms. For example, there
-        are lazy versions of container related operations such as assign, at, back,
-        begin, pop_back, pop_front, push_back, push_front, etc. (See <a class="link" href="../modules/stl.html" title="STL">STL</a>).
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="more.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,149 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Lazy Operators</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="arguments.html" title="Arguments">
-<link rel="next" href="lazy_statements.html" title="Lazy Statements">
-</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="arguments.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_statements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_operators"></a><a class="link" href="lazy_operators.html" title="Lazy Operators">Lazy Operators</a>
-</h3></div></div></div>
-<p>
-        You can use the usual set of operators to form expressions. Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg1</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span>
-<span class="identifier">arg1</span> <span class="special">=</span> <span class="identifier">arg2</span> <span class="special">+</span> <span class="special">(</span><span class="number">3</span> <span class="special">*</span> <span class="identifier">arg3</span><span class="special">)</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">[</span><span class="identifier">arg2</span><span class="special">]</span> <span class="comment">// assuming arg1 is indexable and arg2 is a valid index</span>
-</pre>
-<p>
-        Note the expression: <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
-        <span class="identifier">arg3</span></code>. This expression is actually
-        a short-hand equivalent to: <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
-        <span class="special">*</span> <span class="identifier">arg3</span></code>.
-        In most cases, like above, you can get away with it. But in some cases, you
-        will have to explicitly wrap your values in <code class="computeroutput"><span class="identifier">val</span></code>.
-        Rules of thumb:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            In a binary expression (e.g. <code class="computeroutput"><span class="number">3</span>
-            <span class="special">*</span> <span class="identifier">arg3</span></code>),
-            at least one of the operands must be a phoenix primitive or expression.
-          </li>
-<li class="listitem">
-            In a unary expression (e.g. <code class="computeroutput"><span class="identifier">arg1</span><span class="special">++</span></code>), the single operand must be a phoenix
-            primitive or expression.
-          </li>
-</ul></div>
-<p>
-        If these basic rules are not followed, the result is either an error, or
-        is immediately evaluated. Some examples:
-      </p>
-<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="number">123</span>    <span class="comment">// lazy</span>
-<span class="identifier">x</span> <span class="special">=</span> <span class="number">123</span>         <span class="comment">// immediate</span>
-
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="number">0</span><span class="special">]</span>       <span class="comment">// lazy</span>
-<span class="identifier">x</span><span class="special">[</span><span class="number">0</span><span class="special">]</span>            <span class="comment">// immediate</span>
-
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)]</span>  <span class="comment">// lazy</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="identifier">i</span><span class="special">]</span>       <span class="comment">// lazy (equivalent to ref(x)[val(i)])</span>
-<span class="identifier">x</span><span class="special">[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)]</span>       <span class="comment">// illegal (x is not a phoenix primitive or expression)</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)])</span>  <span class="comment">// illegal (x is not a phoenix primitive or expression)</span>
-</pre>
-<p>
-        Why are the last two expression illegal? Although <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> looks as much like a binary operator as
-        <code class="computeroutput"><span class="keyword">operator</span><span class="special">=</span></code>
-        above it; the difference is that the former must be a member (i.e. <code class="computeroutput"><span class="identifier">x</span></code> must have an <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> that takes a phoenix primitive or expression
-        as its argument). This will most likely not be the case.
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about operators <a class="link" href="../modules/operator.html" title="Operator">here.</a>
-      </p>
-</div>
-<h5>
-<a name="phoenix.starter_kit.lazy_operators.h0"></a>
-        <span><a name="phoenix.starter_kit.lazy_operators.first_practical_example"></a></span><a class="link" href="lazy_operators.html#phoenix.starter_kit.lazy_operators.first_practical_example">First
-        Practical Example</a>
-      </h5>
-<p>
-        We've covered enough ground to present a real world example. We want to find
-        the first odd number in an STL container. Normally we use a functor (function
-        object) or a function pointer and pass that in to STL's <code class="computeroutput"><span class="identifier">find_if</span></code>
-        generic function:
-      </p>
-<p>
-        Write a function:
-      </p>
-<pre class="programlisting"><span class="keyword">bool</span>
-<span class="identifier">is_odd</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Pass a pointer to the function to STL's <code class="computeroutput"><span class="identifier">find_if</span></code>
-        algorithm:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="special">&amp;</span><span class="identifier">is_odd</span><span class="special">)</span>
-</pre>
-<p>
-        Using Phoenix, the same can be achieved directly with a one-liner:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-</pre>
-<p>
-        The expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
-        <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> automagically creates a functor with the
-        expected behavior. In FP, this unnamed function is called a lambda function.
-        Unlike the function pointer version, which is monomorphic (expects and works
-        only with a fixed type int argument), the Phoenix version is fully polymorphic
-        and works with any container (of ints, of longs, of bignum, etc.) as long
-        as its elements can handle the <code class="computeroutput"><span class="identifier">arg1</span>
-        <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> expression.
-      </p>
-<p>
-        (See find_if.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> ...<span class="bold"><strong>That's it, we're done</strong></span>.
-        Well if you wish to know a little bit more, read on...
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="arguments.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_statements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,72 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Lazy Statements</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="lazy_operators.html" title="Lazy Operators">
-<link rel="next" href="construct__new__delete__casts.html" title="Construct, New, Delete, Casts">
-</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="lazy_operators.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_statements"></a><a class="link" href="lazy_statements.html" title="Lazy Statements">Lazy Statements</a>
-</h3></div></div></div>
-<p>
-        Lazy statements? Sure. There are lazy versions of the C++ statements we all
-        know and love. For example:
-      </p>
-<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">&gt;</span> <span class="number">5</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span>
-<span class="special">]</span>
-</pre>
-<p>
-        Say, for example, we wish to print all the elements that are greater than
-        5 (separated by a comma) in a vector. Here's how we write it:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">v</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">v</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">&gt;</span> <span class="number">5</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</pre>
-<p>
-        (See if.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about statements <a class="link" href="../modules/statement.html" title="Statement">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_operators.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,58 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>More</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="lazy_functions.html" title="Lazy Functions">
-<link rel="next" href="../basics.html" title="Basics">
-</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="lazy_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../basics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.more"></a><a class="link" href="more.html" title="More">More</a>
-</h3></div></div></div>
-<p>
-        As mentioned earlier, this chapter is not a thorough discourse of the library.
-        It is meant only to cover enough ground to get you into high gear as quickly
-        as possible. Some advanced stuff is not discussed here (e.g. <a class="link" href="../modules/scope.html" title="Scope">Scopes</a>);
-        nor are features that provide alternative (short-hand) ways to do the same
-        things (e.g. <a class="link" href="../modules/bind.html" title="Bind">Bind</a> vs. <a class="link" href="../modules/function.html" title="Function">Lazy
-        Functions</a>).
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> ...<span class="bold"><strong>If you still wish to learn
-        more, the read on...</strong></span>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../basics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,73 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="values.html" title="Values">
-<link rel="next" href="arguments.html" title="Arguments">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.references"></a><a class="link" href="references.html" title="References">References</a>
-</h3></div></div></div>
-<p>
-        References are functions. They hold a reference to a value stored somewhere.
-        For example, given:
-      </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-</pre>
-<p>
-        we create <code class="computeroutput"><span class="identifier">references</span></code> to
-        <code class="computeroutput"><span class="identifier">i</span></code> and <code class="computeroutput"><span class="identifier">s</span></code>
-        this way:
-      </p>
-<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">s</span><span class="special">)</span>
-</pre>
-<p>
-        Like <code class="computeroutput"><span class="identifier">val</span></code>, the expressions
-        above evaluates to a nullary function; the first one returning an <code class="computeroutput"><span class="keyword">int</span><span class="special">&amp;</span></code>,
-        and the second one returning a <code class="computeroutput"><span class="keyword">char</span>
-        <span class="keyword">const</span><span class="special">*&amp;</span></code>.
-      </p>
-<p>
-        (See references.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about references <a class="link" href="../modules/core/references.html" title="References">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,116 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Values</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="../starter_kit.html" title="Starter Kit">
-<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="../starter_kit.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.values"></a><a class="link" href="values.html" title="Values">Values</a>
-</h3></div></div></div>
-<p>
-        Values are functions! Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
-<span class="identifier">val</span><span class="special">(</span><span class="string">"Hello, World"</span><span class="special">)</span>
-</pre>
-<p>
-        The first evaluates to a nullary function (a function taking no arguments)
-        that returns an <code class="computeroutput"><span class="keyword">int</span></code>, <code class="computeroutput"><span class="number">3</span></code>. The second evaluates to a nullary function
-        that returns a <code class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">(&amp;)[</span><span class="number">13</span><span class="special">]</span></code>, <code class="computeroutput"><span class="string">"Hello,
-        World"</span></code>.
-      </p>
-<h5>
-<a name="phoenix.starter_kit.values.h0"></a>
-        <span><a name="phoenix.starter_kit.values.lazy_evaluation"></a></span><a class="link" href="values.html#phoenix.starter_kit.values.lazy_evaluation">Lazy
-        Evaluation</a>
-      </h5>
-<p>
-        Confused? <code class="computeroutput"><span class="identifier">val</span></code> is a unary
-        function and <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code> invokes
-        it, you say? Yes. However, read carefully: <span class="emphasis"><em>"evaluates to a
-        nullary function"</em></span>. <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
-        evaluates to (returns) a nullary function. Aha! <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
-        returns a function! So, since <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
-        returns a function, you can invoke it. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
-</pre>
-<p>
-        (See values.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about values <a class="link" href="../modules/core/values.html" title="Values">here.</a>
-      </p>
-</div>
-<p>
-        The second function call (the one with no arguments) calls the nullary function
-        which then returns <code class="computeroutput"><span class="number">3</span></code>. The need
-        for a second function call is the reason why the function is said to be
-        <span class="bold"><strong><span class="emphasis"><em>Lazily Evaluated</em></span></strong></span>. The
-        first call doesn't do anything. You need a second call to finally evaluate
-        the thing. The first call lazily evaluates the function; i.e. doesn't do
-        anything and defers the evaluation for later.
-      </p>
-<h5>
-<a name="phoenix.starter_kit.values.h1"></a>
-        <span><a name="phoenix.starter_kit.values.callbacks"></a></span><a class="link" href="values.html#phoenix.starter_kit.values.callbacks">Callbacks</a>
-      </h5>
-<p>
-        It may not be immediately apparent how lazy evaluation can be useful by just
-        looking at the example above. Putting the first and second function call
-        in a single line is really not very useful. However, thinking of <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code> as a callback function (and in most cases
-        they are actually used that way), will make it clear. Example:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">F</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">print</span><span class="special">(</span><span class="identifier">F</span> <span class="identifier">f</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">f</span><span class="special">()</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">int</span>
-<span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="identifier">print</span><span class="special">(</span><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">));</span>
-    <span class="identifier">print</span><span class="special">(</span><span class="identifier">val</span><span class="special">(</span><span class="string">"Hello World"</span><span class="special">));</span>
-    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-        (See callback.cpp)
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../starter_kit.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,44 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>What's New</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="next" href="what_s_new/phoenix_3_0.html" title="Phoenix 3.0">
-</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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.what_s_new"></a><a class="link" href="what_s_new.html" title="What's New">What's New</a>
-</h2></div></div></div>
-<div class="toc"><dl><dt><span class="section">Phoenix 3.0</span></dt></dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,67 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Phoenix 3.0</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../what_s_new.html" title="What's New">
-<link rel="prev" href="../what_s_new.html" title="What's New">
-<link rel="next" href="../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="p" href="../what_s_new.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../what_s_new.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.what_s_new.phoenix_3_0"></a><a class="link" href="phoenix_3_0.html" title="Phoenix 3.0">Phoenix 3.0</a>
-</h3></div></div></div>
-<p>
-        This is the first official release of Phoenix as first class Boost citizen.
-        As a consequence of the review of Phoenix V2 the internals got completely
-        rewritten. Therefore the internal extension mechanism is different.
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            composite&lt;...&gt;, as_composite&lt;...&gt; and compose are gone and
-            have been replaced. For an in depth discussion see the section <a class="link" href="../inside.html" title="Inside Phoenix">Inside Phoenix</a>
-          </li>
-<li class="listitem">
-            <a class="link" href="../modules/function.html" title="Function">phoenix.modules.function</a>
-            phoenix::function now supports function objects that implement the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> protocol. <span class="bold"><strong>This is a breaking change</strong></span>
-          </li>
-<li class="listitem">
-            Boilerplate macros to easily adapt already existing functions and function
-            objects
-          </li>
-<li class="listitem">
-            <a class="link" href="../modules/bind.html" title="Bind">Bind</a> is no completely compatible
-            with Boost.Bind
-          </li>
-</ul></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../what_s_new.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../what_s_new.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html
==============================================================================
--- website/public_html/beta/doc/libs/1_49_0/libs/phoenix/doc/html/phoenix/wrap_up.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,76 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Wrap Up</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="examples/transforming_the_expression_tree.html" title="Transforming the Expression Tree">
-<link rel="next" href="acknowledgments.html" title="Acknowledgments">
-</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/transforming_the_expression_tree.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgments.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.wrap_up"></a><a class="link" href="wrap_up.html" title="Wrap Up">Wrap Up</a>
-</h2></div></div></div>
-<p>
-      Sooner or later more FP techniques become standard practice as people find
-      the true value of this programming discipline outside the academe and into
-      the mainstream. In as much as structured programming of the 70s and object
-      oriented programming in the 80s and generic programming in the 90s shaped our
-      thoughts towards a more robust sense of software engineering, FP will certainly
-      be a paradigm that will catapult us towards more powerful software design and
-      engineering onward into the new millennium.
-    </p>
-<p>
-      Let me quote Doug Gregor of Boost.org. About functional style programming libraries:
-    </p>
-<div class="blockquote"><blockquote class="blockquote"><p>
-        <span class="emphasis"><em>They're gaining acceptance, but are somewhat stunted by the ubiquitousness
-        of broken compilers. The C++ community is moving deeper into the so-called
-        "STL- style" programming paradigm, which brings many aspects of
-        functional programming into the fold. Look at, for instance, the Spirit parser
-        to see how such function objects can be used to build Yacc-like grammars
-        with semantic actions that can build abstract syntax trees on the fly. This
-        type of functional composition is gaining momentum.</em></span>
-      </p></blockquote></div>
-<p>
-      Indeed. Phoenix is another attempt to introduce more FP techniques into the
-      mainstream. Not only is it a tool that will make life easier for the programmer.
-      In its own right, the actual design of the library itself is a model of true
-      C++ FP in action. The library is designed and structured in a strict but clear
-      and well mannered FP sense. By all means, use the library as a tool. But for
-      those who want to learn more about FP in C++, don't stop there, I invite you
-      to take a closer look at the design of the library itself.
-    </p>
-<p>
-      So there you have it. Have fun! See you in the FP world.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="examples/transforming_the_expression_tree.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgments.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/add2.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/add2_call.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/adder.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/alert.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/banner.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/fbox.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/funnel_in.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/funnel_out.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/home.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/important.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/lambda_cpp.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/next.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/note.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/organization.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/organization_alt.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/prev.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/simple_ast.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/smiley.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/tip.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/images/up.png
==============================================================================
Binary file. No diff available.
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/index.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/index.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,306 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Chapter&#160;1.&#160;Phoenix 3.0</title>
-<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="next" href="phoenix/what_s_new.html" title="What's New">
-</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="phoenix/what_s_new.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
-<div class="chapter">
-<div class="titlepage"><div>
-<div><h2 class="title">
-<a name="phoenix"></a>Chapter&#160;1.&#160;Phoenix 3.0</h2></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Joel</span> <span class="surname">de Guzman</span>
-</h3></div></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Dan</span> <span class="surname">Marsden</span>
-</h3></div></div>
-<div><div class="author"><h3 class="author">
-<span class="firstname">Thomas</span> <span class="surname">Heller</span>
-</h3></div></div>
-<div><p class="copyright">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller</p></div>
-<div><div class="legalnotice">
-<a name="phoenix.legal"></a><p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></div>
-</div></div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="section">What's New</span></dt>
-<dd><dl><dt><span class="section">Phoenix 3.0</span></dt></dl></dd>
-<dt><span class="section">Introduction</span></dt>
-<dt><span class="section">Starter Kit</span></dt>
-<dd><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Lazy Operators</span></dt>
-<dt><span class="section">Lazy Statements</span></dt>
-<dt><span class="section"><a href="phoenix/starter_kit/construct__new__delete__casts.html">Construct,
-      New, Delete, Casts</a></span></dt>
-<dt><span class="section">Lazy Functions</span></dt>
-<dt><span class="section">More</span></dt>
-</dl></dd>
-<dt><span class="section">Basics</span></dt>
-<dt><span class="section">Organization</span></dt>
-<dt><span class="section">Actor</span></dt>
-<dt><span class="section">Modules</span></dt>
-<dd><dl>
-<dt><span class="section">Core</span></dt>
-<dd><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Nothing</span></dt>
-</dl></dd>
-<dt><span class="section">Function</span></dt>
-<dd><dl><dt><span class="section"><a href="phoenix/modules/function/adapting_functions.html">Adapting
-        Functions</a></span></dt></dl></dd>
-<dt><span class="section">Operator</span></dt>
-<dt><span class="section">Statement</span></dt>
-<dd><dl>
-<dt><span class="section">Block Statement</span></dt>
-<dt><span class="section">if_ Statement</span></dt>
-<dt><span class="section">if_else_ Statement</span></dt>
-<dt><span class="section"><a href="phoenix/modules/statement/switch__statement.html">switch_
-        Statement</a></span></dt>
-<dt><span class="section"><a href="phoenix/modules/statement/while__statement.html">while_
-        Statement</a></span></dt>
-<dt><span class="section">do_while_ Statement</span></dt>
-<dt><span class="section">for_ Statement</span></dt>
-<dt><span class="section"><a href="phoenix/modules/statement/try__catch__statement.html">try_
-        catch_ Statement</a></span></dt>
-<dt><span class="section">throw_</span></dt>
-</dl></dd>
-<dt><span class="section">Object</span></dt>
-<dd><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section">New</span></dt>
-<dt><span class="section">Delete</span></dt>
-<dt><span class="section">Casts</span></dt>
-</dl></dd>
-<dt><span class="section">Scope</span></dt>
-<dd><dl>
-<dt><span class="section">Local Variables</span></dt>
-<dt><span class="section">let</span></dt>
-<dt><span class="section">lambda</span></dt>
-</dl></dd>
-<dt><span class="section">Bind</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="phoenix/modules/bind/binding_function_objects.html">Binding
-        Function Objects</a></span></dt>
-<dt><span class="section">Binding Functions</span></dt>
-<dt><span class="section"><a href="phoenix/modules/bind/binding_member_functions.html">Binding
-        Member Functions</a></span></dt>
-<dt><span class="section"><a href="phoenix/modules/bind/binding_member_variables.html">Binding
-        Member Variables</a></span></dt>
-<dt><span class="section"><a href="phoenix/modules/bind/compatibility_with_boost_bind.html">Compatibility
-        with Boost.Bind</a></span></dt>
-</dl></dd>
-<dt><span class="section">STL</span></dt>
-<dd><dl>
-<dt><span class="section">Container</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-</dl></dd>
-</dl></dd>
-<dt><span class="section">Inside Phoenix</span></dt>
-<dd><dl>
-<dt><span class="section">Actors in Detail</span></dt>
-<dt><span class="section">Phoenix Expressions</span></dt>
-<dd><dl><dt><span class="section"><a href="phoenix/inside/expression/boilerplate_macros.html">Boilerplate
-        Macros</a></span></dt></dl></dd>
-<dt><span class="section">More on Actions</span></dt>
-<dt><span class="section">Predefined Expressions and Rules</span></dt>
-<dt><span class="section">Custom Terminals</span></dt>
-<dt><span class="section">Placeholder Unification</span></dt>
-</dl></dd>
-<dt><span class="section">Advanced Examples</span></dt>
-<dd><dl>
-<dt><span class="section">Extending Actors</span></dt>
-<dt><span class="section">Adding an expression</span></dt>
-<dt><span class="section"><a href="phoenix/examples/transforming_the_expression_tree.html">Transforming
-      the Expression Tree</a></span></dt>
-</dl></dd>
-<dt><span class="section">Wrap Up</span></dt>
-<dt><span class="section">Acknowledgments</span></dt>
-<dt><span class="section">References</span></dt>
-</dl>
-</div>
-<h2>
-<a name="phoenix.h0"></a>
-    <span><a name="phoenix.preface"></a></span><a class="link" href="index.html#phoenix.preface">Preface</a>
-  </h2>
-<div class="blockquote"><blockquote class="blockquote"><p>
-      <span class="emphasis"><em>Functional programming is so called because a program consists entirely
-      of functions. The main program itself is written as a function which receives
-      the program's input as its argument and delivers the program's output as its
-      result. Typically the main function is defined in terms of other functions,
-      which in turn are defined in terms of still more functions until at the bottom
-      level the functions are language primitives.</em></span>
-    </p></blockquote></div>
-<div class="blockquote"><blockquote class="blockquote"><p>
-      <span class="bold"><strong>John Hughes</strong></span>-- <span class="emphasis"><em>Why Functional Programming
-      Matters</em></span>
-    </p></blockquote></div>
-<p>
-    <span class="inlinemediaobject"><img src="images/lambda_cpp.png" alt="lambda_cpp"></span>
-  </p>
-<h3>
-<a name="phoenix.h1"></a>
-    <span><a name="phoenix.description"></a></span><a class="link" href="index.html#phoenix.description">Description</a>
-  </h3>
-<p>
-    Phoenix enables Functional Programming (FP) in C++. The design and implementation
-    of Phoenix is highly influenced by FC++
-    by Yannis Smaragdakis and Brian McNamara and the BLL
-    (Boost Lambda Library) by Jaakko Jaarvi and Gary Powell. Phoenix is a blend of
-    FC++ and BLL using the implementation techniques used in the Spirit
-    inline parser.
-  </p>
-<p>
-    Phoenix is a header only library. It is extremely modular by design. One can
-    extract and use only a small subset of the full library, literally tearing the
-    library into small pieces, without fear that the pieces won't work anymore. The
-    library is organized in highly independent modules and layers.
-  </p>
-<h3>
-<a name="phoenix.h2"></a>
-    <span><a name="phoenix.how_to_use_this_manual"></a></span><a class="link" href="index.html#phoenix.how_to_use_this_manual">How
-    to use this manual</a>
-  </h3>
-<p>
-    The Phoenix library is organized in logical modules. This documentation provides
-    a user's guide and reference for each module in the library. A simple and clear
-    code example is worth a hundred lines of documentation; therefore, the user's
-    guide is presented with abundant examples annotated and explained in step-wise
-    manner. The user's guide is based on examples: lots of them.
-  </p>
-<p>
-    As much as possible, forward information (i.e. citing a specific piece of information
-    that has not yet been discussed) is avoided in the user's manual portion of each
-    module. In many cases, though, it is unavoidable that advanced but related topics
-    not be interspersed with the normal flow of discussion. To alleviate this problem,
-    topics categorized as "advanced" may be skipped at first reading.
-  </p>
-<p>
-    Some icons are used to mark certain topics indicative of their relevance. These
-    icons precede some text to indicate:
-  </p>
-<div class="table">
-<a name="phoenix.t0"></a><p class="title"><b>Table&#160;1.1.&#160;Icons</b></p>
-<div class="table-contents"><table class="table" summary="Icons">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-            <p>
-              Icon
-            </p>
-          </th>
-<th>
-            <p>
-              Name
-            </p>
-          </th>
-<th>
-            <p>
-              Meaning
-            </p>
-          </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-            <p>
-              <span class="inlinemediaobject"><img src="images/note.png" alt="note"></span>
-            </p>
-          </td>
-<td>
-            <p>
-              Note
-            </p>
-          </td>
-<td>
-            <p>
-              Information provided is auxiliary but will give the reader a deeper
-              insight into a specific topic. May be skipped.
-            </p>
-          </td>
-</tr>
-<tr>
-<td>
-            <p>
-              <span class="inlinemediaobject"><img src="images/alert.png" alt="alert"></span>
-            </p>
-          </td>
-<td>
-            <p>
-              Alert
-            </p>
-          </td>
-<td>
-            <p>
-              Information provided is of utmost importance.
-            </p>
-          </td>
-</tr>
-<tr>
-<td>
-            <p>
-              <span class="inlinemediaobject"><img src="images/tip.png" alt="tip"></span>
-            </p>
-          </td>
-<td>
-            <p>
-              Tip
-            </p>
-          </td>
-<td>
-            <p>
-              A potentially useful and helpful piece of information.
-            </p>
-          </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="sidebar">
-<div class="titlepage"></div>
-<p>
-    <span class="inlinemediaobject"><img src="images/note.png" alt="note"></span> Unless otherwise noted <code class="computeroutput"><span class="keyword">using</span>
-    <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">;</span></code>
-    is assumed
-  </p>
-</div>
-<h3>
-<a name="phoenix.h3"></a>
-    <span><a name="phoenix._emphasis_role__bold___emphasis____to_joel_s_dear_daughter__phoenix__emphasis___emphasis_"></a></span><a class="link" href="index.html#phoenix._emphasis_role__bold___emphasis____to_joel_s_dear_daughter__phoenix__emphasis___emphasis_"><span class="bold"><strong><span class="emphasis"><em>...To Joel's dear daughter, Phoenix</em></span></strong></span></a>
-  </h3>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: July 14, 2012 at 06:12:57 GMT</small></p></td>
-<td align="right"><div class="copyright-footer"></div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav"><a accesskey="n" href="phoenix/what_s_new.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/acknowledgments.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,94 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Acknowledgments</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="wrap_up.html" title="Wrap Up">
-<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="wrap_up.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.acknowledgments"></a><a class="link" href="acknowledgments.html" title="Acknowledgments">Acknowledgments</a>
-</h2></div></div></div>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Hartmut Kaiser implemented the original lazy casts and constructors based
-          on his original work on Spirit SE "semantic expressions" (the
-          precursor to Phoenix), and guided Phoenix from the initial review of V2
-          to the release of V3.
-        </li>
-<li class="listitem">
-          Eric Niebler did a 2.0 pre-release review and wrote some range related
-          code that Phoenix stole and used in the algorithms. Additionally he played
-          the leading role in inventing the extension mechanism as well as providing
-          early prototypes and helping with Boost.Proto code. DA Proto MAN!
-        </li>
-<li class="listitem">
-          Angus Leeming implemented the container functions on Phoenix-1 which I
-          then ported to Phoenix-2.
-        </li>
-<li class="listitem">
-          Daniel Wallin helped with the scope module, local variables, let and lambda
-          and the algorithms. I frequently discuss design issues with Daniel on Yahoo
-          Messenger.
-        </li>
-<li class="listitem">
-          Jaakko Jarvi. DA Lambda MAN!
-        </li>
-<li class="listitem">
-          Dave Abrahams, for his constant presence, wherever, whenever.
-        </li>
-<li class="listitem">
-          Aleksey Gurtovoy, DA MPL MAN!
-        </li>
-<li class="listitem">
-          Doug Gregor, always a source of inspiration.
-        </li>
-<li class="listitem">
-          Dan Marsden, did almost all the work in bringing Phoenix-2 out the door.
-        </li>
-<li class="listitem">
-          Thorsten Ottosen; Eric's range_ex code began life as "container_algo"
-          in the old boost sandbox, by Thorsten in 2002-2003.
-        </li>
-<li class="listitem">
-          Jeremy Siek, even prior to Thorsten, in 2001, started the "container_algo".
-        </li>
-<li class="listitem">
-          Vladimir Prus wrote the mutating algorithms code from the Boost Wiki.
-        </li>
-<li class="listitem">
-          Daryle Walker did a 2.0 pre-release review.
-        </li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="wrap_up.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/actor.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/actor.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,90 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Actor</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="organization.html" title="Organization">
-<link rel="next" href="modules.html" title="Modules">
-</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="organization.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.actor"></a><a class="link" href="actor.html" title="Actor">Actor</a>
-</h2></div></div></div>
-<p>
-      The <code class="computeroutput"><span class="identifier">Actor</span></code> is the main concept
-      behind the library. Actors are function objects. An actor can accept 0 to
-      <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code> arguments.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>,
-        the predefined maximum arity an actor can take. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code> is set to 10.
-      </p></td></tr>
-</table></div>
-<p>
-      Phoenix supplies an <code class="computeroutput"><span class="identifier">actor</span></code> class
-      template whose specializations model the <code class="computeroutput"><span class="identifier">Actor</span></code>
-      concept. <code class="computeroutput"><span class="identifier">actor</span></code> has one template
-      parameter, <code class="computeroutput"><span class="identifier">Expr</span></code>, that supplies
-      the underlying expression to evaluate.
-    </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">actor</span>
-<span class="special">{</span>
-    <span class="identifier">return_type</span>
-    <span class="keyword">operator</span><span class="special">()()</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">&gt;</span>
-    <span class="identifier">return_type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">&gt;</span>
-    <span class="identifier">return_type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">&amp;</span> <span class="identifier">_1</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="comment">//...</span>
-<span class="special">};</span>
-</pre>
-<p>
-      The actor class accepts the arguments through a set of function call operators
-      for 0 to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-      arities (Don't worry about the details, for now. Note, for example, that we
-      skimp over the details regarding <code class="computeroutput"><span class="identifier">return_type</span></code>).
-      The arguments are passed through to the evaluation mechanism. For more information
-      see <a class="link" href="inside/actor.html" title="Actors in Detail">Inside Actors</a>.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="organization.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/basics.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/basics.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,273 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Basics</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="starter_kit/more.html" title="More">
-<link rel="next" href="organization.html" title="Organization">
-</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="starter_kit/more.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.basics"></a><a class="link" href="basics.html" title="Basics">Basics</a>
-</h2></div></div></div>
-<p>
-      Almost everything is a function in the Phoenix library that can be evaluated
-      as <code class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="identifier">a1</span><span class="special">,</span> <span class="identifier">a2</span><span class="special">,</span> <span class="special">...,</span> a/n/<span class="special">)</span></code>, where <span class="emphasis"><em>n</em></span> is the function's
-      arity, or number of arguments that the function expects. Operators are also
-      functions. For example, <code class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></code> is just
-      a function with arity == 2 (or binary). <code class="computeroutput"><span class="identifier">a</span>
-      <span class="special">+</span> <span class="identifier">b</span></code>
-      is the same as <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">a</span>
-      <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="identifier">c</span></code> is the
-      same as <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">),</span>
-      <span class="identifier">c</span><span class="special">)</span></code>.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        Amusingly, functions may even return functions. We shall see what this means
-        in a short while.
-      </p></td></tr>
-</table></div>
-<h4>
-<a name="phoenix.basics.h0"></a>
-      <span><a name="phoenix.basics.partial_function_application"></a></span><a class="link" href="basics.html#phoenix.basics.partial_function_application">Partial
-      Function Application</a>
-    </h4>
-<p>
-      Think of a function as a black box. You pass arguments and it returns something
-      back. The figure below depicts the typical scenario.
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/fbox.png" alt="fbox"></span>
-    </p>
-<p>
-      A fully evaluated function is one in which all the arguments are given. All
-      functions in plain C++ are fully evaluated. When you call the <code class="computeroutput"><span class="identifier">sin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> function, you have to pass a number x. The
-      function will return a result in return: the sin of x. When you call the <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">)</span></code>
-      function, you have to pass two numbers x and y. The function will return the
-      sum of the two numbers. The figure below is a fully evaluated <code class="computeroutput"><span class="identifier">add</span></code> function.
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/adder.png" alt="adder"></span>
-    </p>
-<p>
-      A partially applied function, on the other hand, is one in which not all the
-      arguments are supplied. If we are able to partially apply the function <code class="computeroutput"><span class="identifier">add</span></code> above, we may pass only the first argument.
-      In doing so, the function does not have all the required information it needs
-      to perform its task to compute and return a result. What it returns instead
-      is another function, a lambda function. Unlike the original <code class="computeroutput"><span class="identifier">add</span></code>
-      function which has an arity of 2, the resulting lambda function has an arity
-      of 1. Why? because we already supplied part of the input: <code class="computeroutput"><span class="number">2</span></code>
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/add2.png" alt="add2"></span>
-    </p>
-<p>
-      Now, when we shove in a number into our lambda function, it will return 2 plus
-      whatever we pass in. The lambda function essentially remembers 1) the original
-      function, <code class="computeroutput"><span class="identifier">add</span></code>, and 2) the partial
-      input, 2. The figure below illustrates a case where we pass 3 to our lambda
-      function, which then returns 5:
-    </p>
-<p>
-      <span class="inlinemediaobject"><img src="../images/add2_call.png" alt="add2_call"></span>
-    </p>
-<p>
-      Obviously, partially applying the <code class="computeroutput"><span class="identifier">add</span></code>
-      function, as we see above, cannot be done directly in C++ where we are expected
-      to supply all the arguments that a function expects. That's where the Phoenix
-      library comes in. The library provides the facilities to do partial function
-      application. And even more, with Phoenix, these resulting functions won't be
-      black boxes anymore.
-    </p>
-<h4>
-<a name="phoenix.basics.h1"></a>
-      <span><a name="phoenix.basics.stl_and_higher_order_functions"></a></span><a class="link" href="basics.html#phoenix.basics.stl_and_higher_order_functions">STL
-      and higher order functions</a>
-    </h4>
-<p>
-      So, what's all the fuss? What makes partial function application so useful?
-      Recall our original example in the <a class="link" href="starter_kit/lazy_operators.html" title="Lazy Operators">previous
-      section</a>:
-    </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-</pre>
-<p>
-      The expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
-      <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> evaluates to a lambda function. <code class="computeroutput"><span class="identifier">arg1</span></code> is a placeholder for an argument to
-      be supplied later. Hence, since there's only one unsupplied argument, the lambda
-      function has an arity 1. It just so happens that <code class="computeroutput"><span class="identifier">find_if</span></code>
-      supplies the unsupplied argument as it loops from <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-      to <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        Higher order functions are functions which can take other functions as arguments,
-        and may also return functions as results. Higher order functions are functions
-        that are treated like any other objects and can be used as arguments and
-        return values from functions.
-      </p></td></tr>
-</table></div>
-<h4>
-<a name="phoenix.basics.h2"></a>
-      <span><a name="phoenix.basics.lazy_evaluation"></a></span><a class="link" href="basics.html#phoenix.basics.lazy_evaluation">Lazy
-      Evaluation</a>
-    </h4>
-<p>
-      In Phoenix, to put it more accurately, function evaluation has two stages:
-    </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Partial application
-        </li>
-<li class="listitem">
-          Final evaluation
-        </li>
-</ol></div>
-<p>
-      The first stage is handled by a set of generator functions. These are your
-      front ends (in the client's perspective). These generators create (through
-      partial function application), higher order functions that can be passed on
-      just like any other function pointer or function object. The second stage,
-      the actual function call, can be invoked or executed anytime in the future,
-      or not at all; hence <span class="emphasis"><em>"lazy"</em></span>.
-    </p>
-<p>
-      If we look more closely, the first step involves partial function application:
-    </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span>
-</pre>
-<p>
-      The second step is the actual function invocation (done inside the <code class="computeroutput"><span class="identifier">find_if</span></code> function. These are the back-ends
-      (often, the final invocation is never actually seen by the client). In our
-      example, the <code class="computeroutput"><span class="identifier">find_if</span></code>, if we
-      take a look inside, we'll see something like:
-    </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Predicate</span><span class="special">&gt;</span>
-<span class="identifier">InputIterator</span>
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">pred</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">while</span> <span class="special">(</span><span class="identifier">first</span> <span class="special">!=</span> <span class="identifier">last</span> <span class="special">&amp;&amp;</span> <span class="special">!</span><span class="identifier">pred</span><span class="special">(*</span><span class="identifier">first</span><span class="special">))</span>  <span class="comment">// &lt;--- The lambda function is called here</span>
-        <span class="special">++</span><span class="identifier">first</span><span class="special">;</span>                            <span class="comment">//      passing in *first</span>
-    <span class="keyword">return</span> <span class="identifier">first</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-      Again, typically, we, as clients, see only the first step. However, in this
-      document and in the examples and tests provided, don't be surprised to see
-      the first and second steps juxtaposed in order to illustrate the complete semantics
-      of Phoenix expressions. Examples:
-    </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">x</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
-<span class="keyword">int</span> <span class="identifier">y</span> <span class="special">=</span> <span class="number">2</span><span class="special">;</span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 1 or true</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">y</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 0 or false</span>
-</pre>
-<h4>
-<a name="phoenix.basics.h3"></a>
-      <span><a name="phoenix.basics.forwarding_function_problem"></a></span><a class="link" href="basics.html#phoenix.basics.forwarding_function_problem">Forwarding
-      Function Problem</a>
-    </h4>
-<p>
-      Usually, we, as clients, write the call-back functions while libraries (such
-      as STL) provide the callee (e.g. <code class="computeroutput"><span class="identifier">find_if</span></code>).
-      In case the role is reversed, e.g. if you have to write an STL algorithm that
-      takes in a predicate, or develop a GUI library that accepts event handlers,
-      you have to be aware of a little known problem in C++ called the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
-      Function Problem</a>".
-    </p>
-<p>
-      Look again at the code above:
-    </p>
-<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span>
-</pre>
-<p>
-      Notice that, in the second-stage (the final evaluation), we used a variable
-      <code class="computeroutput"><span class="identifier">x</span></code>.
-    </p>
-<p>
-      In Phoenix we emulated perfect forwarding through preprocessor macros generating
-      code to allow const and non-const references.
-    </p>
-<p>
-      We generate these second-stage overloads for Phoenix expression up to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARD_LIMIT</span></code>
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARD_LIMIT</span></code>,
-        the predefined maximum perfect forward arguments an actor can take. By default,
-        <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARDLIMIT</span></code>
-        is set to 3.
-      </p></td></tr>
-</table></div>
-<h4>
-<a name="phoenix.basics.h4"></a>
-      <span><a name="phoenix.basics.polymorphic_functions"></a></span><a class="link" href="basics.html#phoenix.basics.polymorphic_functions">Polymorphic
-      Functions</a>
-    </h4>
-<p>
-      Unless otherwise noted, Phoenix generated functions are fully polymorphic.
-      For instance, the <code class="computeroutput"><span class="identifier">add</span></code> example
-      above can apply to integers, floating points, user defined complex numbers
-      or even strings. Example:
-    </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">h</span><span class="special">(</span><span class="string">"Hello"</span><span class="special">);</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">w</span> <span class="special">=</span> <span class="string">" World"</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">h</span><span class="special">,</span> <span class="identifier">w</span><span class="special">);</span>
-</pre>
-<p>
-      evaluates to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">(</span><span class="string">"Hello
-      World"</span><span class="special">)</span></code>. The observant
-      reader might notice that this function call in fact takes in heterogeneous
-      arguments where <code class="computeroutput"><span class="identifier">arg1</span></code> is of
-      type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> and <code class="computeroutput"><span class="identifier">arg2</span></code>
-      is of type <code class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span></code>. <code class="computeroutput"><span class="identifier">add</span></code>
-      still works because the C++ standard library allows the expression <code class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></code>
-      where <code class="computeroutput"><span class="identifier">a</span></code> is a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code>
-      and <code class="computeroutput"><span class="identifier">b</span></code> is a <code class="computeroutput"><span class="keyword">char</span>
-      <span class="keyword">const</span><span class="special">*</span></code>.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="starter_kit/more.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,49 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Advanced Examples</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="inside/placeholder_unification.html" title="Placeholder Unification">
-<link rel="next" href="examples/extending_actors.html" title="Extending Actors">
-</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="inside/placeholder_unification.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/extending_actors.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.examples"></a><a class="link" href="examples.html" title="Advanced Examples">Advanced Examples</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Extending Actors</span></dt>
-<dt><span class="section">Adding an expression</span></dt>
-<dt><span class="section"><a href="examples/transforming_the_expression_tree.html">Transforming
-      the Expression Tree</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="inside/placeholder_unification.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/extending_actors.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/adding_an_expression.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,158 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Adding an expression</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../examples.html" title="Advanced Examples">
-<link rel="prev" href="extending_actors.html" title="Extending Actors">
-<link rel="next" href="transforming_the_expression_tree.html" title="Transforming the Expression Tree">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="extending_actors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transforming_the_expression_tree.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.examples.adding_an_expression"></a><a class="link" href="adding_an_expression.html" title="Adding an expression">Adding an expression</a>
-</h3></div></div></div>
-<p>
-        This is not a toy example. This is actually part of the library. Remember
-        the <a class="link" href="../modules/statement/while__statement.html" title="while_ Statement"><code class="computeroutput"><span class="keyword">while</span></code></a> lazy statement? Putting together
-        everything we've learned so far, we eill present it here in its entirety
-        (verbatim):
-      </p>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">boost</span><span class="special">)(</span><span class="identifier">phoenix</span><span class="special">)(</span><span class="identifier">while_</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>           <span class="comment">// Cond</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>           <span class="comment">// Do</span>
-<span class="special">)</span>
-
-<span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">phoenix</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">while_eval</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">void</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-        <span class="identifier">result_type</span>
-        <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">,</span> <span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">do_</span><span class="special">,</span> <span class="identifier">Context</span> <span class="special">&amp;</span> <span class="identifier">ctx</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">while</span><span class="special">(</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">))</span>
-            <span class="special">{</span>
-                <span class="identifier">eval</span><span class="special">(</span><span class="identifier">do_</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">);</span>
-            <span class="special">}</span>
-        <span class="special">}</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">default_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">while_</span><span class="special">,</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-        <span class="special">:</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="identifier">while_eval</span><span class="special">,</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-    <span class="special">{};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">while_gen</span>
-    <span class="special">{</span>
-        <span class="identifier">while_gen</span><span class="special">(</span><span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">cond</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span> <span class="special">{}</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">&gt;</span>
-        <span class="keyword">typename</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span>
-        <span class="keyword">operator</span><span class="special">[](</span><span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">do_</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">do_</span><span class="special">);</span>
-        <span class="special">}</span>
-
-        <span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">&gt;</span>
-    <span class="identifier">while_gen</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">&gt;</span> <span class="keyword">const</span>
-    <span class="identifier">while_</span><span class="special">(</span><span class="identifier">Cond</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">cond</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">while_gen</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">&gt;(</span><span class="identifier">cond</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">}}</span>
-</pre>
-<p>
-        <code class="computeroutput"><span class="identifier">while_eval</span></code> is an example
-        of how to evaluate an expression. It gets called in the <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="keyword">while</span></code> action.
-        <code class="computeroutput"><span class="identifier">while_gen</span></code> and <code class="computeroutput"><span class="identifier">while_</span></code> are the expression template front
-        ends. Let's break this apart to undestand what's happening. Let's start at
-        the bottom. It's easier that way.
-      </p>
-<p>
-        When you write:
-      </p>
-<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
-</pre>
-<p>
-        we generate an instance of <code class="computeroutput"><span class="identifier">while_gen</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">&gt;</span></code>, where <code class="computeroutput"><span class="identifier">Cond</span></code>
-        is the type of <code class="computeroutput"><span class="identifier">cond</span></code>. <code class="computeroutput"><span class="identifier">cond</span></code> can be an arbitrarily complex actor
-        expression. The <code class="computeroutput"><span class="identifier">while_gen</span></code>
-        template class has an <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> accepting another expression. If we write:
-      </p>
-<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">do_</span>
-<span class="special">]</span>
-</pre>
-<p>
-        it will generate a proper composite with the type:
-      </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-        where <code class="computeroutput"><span class="identifier">Cond</span></code> is the type of
-        <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">Do</span></code>
-        is the type of <code class="computeroutput"><span class="identifier">do_</span></code>. Notice
-        how we are using Phoenix's <a class="link" href="../inside/expression.html" title="Phoenix Expressions">Expression</a>
-        mechanism here
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span>
-<span class="keyword">operator</span><span class="special">[](</span><span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">do_</span><span class="special">)</span> <span class="keyword">const</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">do_</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Finally, the <code class="computeroutput"><span class="identifier">while_eval</span></code> does
-        its thing:
-      </p>
-<pre class="programlisting"><span class="keyword">while</span><span class="special">(</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">cond</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">))</span>
-<span class="special">{</span>
-    <span class="identifier">eval</span><span class="special">(</span><span class="identifier">do_</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">do_</span></code>,
-        at this point, are instances of <a class="link" href="../inside/actor.html" title="Actors in Detail">Actor</a>.
-        <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">do_</span></code>
-        are the <a class="link" href="../inside/actor.html" title="Actors in Detail">Actors</a> passed as parameters
-        by <code class="computeroutput"><span class="identifier">call</span></code>, ctx is the <a class="link" href="../inside/actor.html" title="Actors in Detail">Context</a>
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="extending_actors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transforming_the_expression_tree.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/extending_actors.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,320 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Extending Actors</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../examples.html" title="Advanced Examples">
-<link rel="prev" href="../examples.html" title="Advanced Examples">
-<link rel="next" href="adding_an_expression.html" title="Adding an expression">
-</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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adding_an_expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.examples.extending_actors"></a><a class="link" href="extending_actors.html" title="Extending Actors">Extending Actors</a>
-</h3></div></div></div>
-<p>
-        <a class="link" href="../inside/actor.html" title="Actors in Detail">Actors</a> are one of the main parts
-        of the library, and one of the many customization points. The default actor
-        implementation provides several operator() overloads which deal with the
-        evaluation of expressions.
-      </p>
-<p>
-        For some use cases this might not be enough. For convenience it is thinkable
-        to provide custom member functions which generate new expressions. An example
-        is the <a class="link" href="../modules/statement/___if_else_____statement.html" title="if_else_ Statement">if_else_
-Statement</a>
-        which provides an additional else member for generating a lazy if-else expression.
-        With this the actual Phoenix expression becomes more expressive.
-      </p>
-<p>
-        Another scenario is to give actors the semantics of a certain well known
-        interface or concept. This tutorial like section will provide information
-        on how to implement a custom actor which is usable as if it were a STL Container.
-      </p>
-<h5>
-<a name="phoenix.examples.extending_actors.h0"></a>
-        <span><a name="phoenix.examples.extending_actors.requirements"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.requirements">Requirements</a>
-      </h5>
-<p>
-        Let's repeat what we want to have:
-      </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns an iterator pointing to the first element in the container.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns an iterator pointing one past the last element in the container.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns the size of the container, that is, its number of elements.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">max_size</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns the largest size that this container can ever have.
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Equivalent to a.size() == 0. (But possibly faster.)
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span><span class="special">.</span><span class="identifier">swap</span><span class="special">(</span><span class="identifier">b</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Equivalent to swap(a,b)
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-<p>
-        Additionally, we want all the operator() overloads of the regular actor.
-      </p>
-<h5>
-<a name="phoenix.examples.extending_actors.h1"></a>
-        <span><a name="phoenix.examples.extending_actors.defining_the_actor"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.defining_the_actor">Defining the
-        actor</a>
-      </h5>
-<p>
-        The first version of our <code class="computeroutput"><span class="identifier">container_actor</span></code>
-        interface will show the general principle. This will be continually extended.
-        For the sake of simplicity, every member function generator will return
-        <a class="link" href="../modules/core/nothing.html" title="Nothing"><code class="computeroutput"><span class="identifier">nothing</span></code></a>
-        at first.
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">container_actor</span>
-	<span class="special">:</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="special">{</span>
-	<span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
-	<span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-	
-	<span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
-		<span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
-
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">max_size</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-
-	<span class="comment">// Note that swap is the only function needing another container.</span>
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-	<span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">swap</span><span class="special">(</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Container</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">)</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">nothing</span><span class="special">;</span> <span class="special">}</span>
-<span class="special">};</span>
-</pre>
-<h5>
-<a name="phoenix.examples.extending_actors.h2"></a>
-        <span><a name="phoenix.examples.extending_actors.using_the_actor"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.using_the_actor">Using
-        the actor</a>
-      </h5>
-<p>
-        Although the member functions do nothing right now, we want to test if we
-        can use our new actor.
-      </p>
-<p>
-        First, lets create a generator which wraps the <code class="computeroutput"><span class="identifier">container_actor</span></code>
-        around any other expression:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="keyword">const</span>
-<span class="identifier">container</span><span class="special">(</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">expr</span> <span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expr</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Now let's test this:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">v</span><span class="special">;</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">0</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">3</span><span class="special">);</span>
-
-<span class="special">(</span><span class="identifier">container</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">).</span><span class="identifier">size</span><span class="special">())(</span><span class="identifier">v</span><span class="special">);</span>
-</pre>
-<p>
-        Granted, this is not really elegant and not very practical (we could have
-        just used phoenix::begin(v) from the <a class="link" href="../modules/stl/algorithm.html" title="Algorithm">Phoenix
-        algorithm module</a>, but we can do better.
-      </p>
-<p>
-        Let's have an <a class="link" href="../modules/core/arguments.html" title="Arguments">argument placeholder</a>
-        which is usable as if it was a STL container:
-      </p>
-<pre class="programlisting"><span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">con1</span><span class="special">;</span>
-<span class="comment">// and so on ...</span>
-</pre>
-<p>
-        The above example can be rewritten as:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">v</span><span class="special">;</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">0</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
-<span class="identifier">v</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">3</span><span class="special">);</span>
-
-<span class="special">(</span><span class="identifier">con1</span><span class="special">.</span><span class="identifier">size</span><span class="special">())(</span><span class="identifier">v</span><span class="special">);</span>
-</pre>
-<p>
-        Wow, that was easy!
-      </p>
-<h5>
-<a name="phoenix.examples.extending_actors.h3"></a>
-        <span><a name="phoenix.examples.extending_actors.adding_life_to_the_actor"></a></span><a class="link" href="extending_actors.html#phoenix.examples.extending_actors.adding_life_to_the_actor">Adding
-        life to the actor</a>
-      </h5>
-<p>
-        This one will be even easier!
-      </p>
-<p>
-        First, we define a <a class="link" href="../modules/function.html" title="Function">lazy function</a>
-        which evaluates the expression we want to implement. Following is the implementation
-        of the size function:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">size_impl</span>
-<span class="special">{</span>
-	<span class="comment">// result_of protocol:</span>
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-	<span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-	<span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">Container</span><span class="special">)&gt;</span>
-	<span class="special">{</span>
-		<span class="comment">// Note, remove reference here, because Container can be anything</span>
-		<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">Container</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">container_type</span><span class="special">;</span>
-
-		<span class="comment">// The result will be size_type</span>
-		<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">container_type</span><span class="special">::</span><span class="identifier">size_type</span> <span class="identifier">type</span><span class="special">;</span>
-	<span class="special">};</span>
-
-	<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">&gt;</span>
-	<span class="keyword">typename</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">size_impl</span><span class="special">(</span><span class="identifier">Container</span> <span class="keyword">const</span><span class="special">&amp;)&gt;::</span><span class="identifier">type</span>
-	<span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Container</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">container</span><span class="special">)</span> <span class="keyword">const</span>
-	<span class="special">{</span>
-		<span class="keyword">return</span> <span class="identifier">container</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span>
-	<span class="special">}</span>
-<span class="special">};</span>
-</pre>
-<p>
-        Good, this was the first part. The second part will be to implement the size
-        member function of <code class="computeroutput"><span class="identifier">container_actor</span></code>:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">container_actor</span>
-	<span class="special">:</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="special">{</span>
-	<span class="keyword">typedef</span> <span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
-	<span class="keyword">typedef</span> <span class="identifier">container_actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;</span> <span class="identifier">that_type</span><span class="special">;</span>
-	
-	<span class="identifier">container_actor</span><span class="special">(</span> <span class="identifier">base_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">base</span> <span class="special">)</span>
-		<span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span> <span class="identifier">base</span> <span class="special">)</span> <span class="special">{}</span>
-
-	<span class="keyword">typename</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">size_impl</span><span class="special">,</span> <span class="identifier">that_type</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span>
-	<span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span>
-	<span class="special">{</span>
-		<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">size_impl</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">f</span> <span class="special">=</span> <span class="identifier">size_impl</span><span class="special">();</span>
-		<span class="keyword">return</span> <span class="identifier">f</span><span class="special">(*</span><span class="keyword">this</span><span class="special">);</span>
-	<span class="special">}</span>
-
-	<span class="comment">// the rest ...</span>
-<span class="special">};</span>
-</pre>
-<p>
-        It is left as an exercise to the user to implement the missing parts by reusing
-        functions from the <a class="link" href="../modules/stl/algorithm.html" title="Algorithm">Phoenix
-        Algorithm Module</a> (the impatient take a look here: container_actor.cpp).
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adding_an_expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/examples/transforming_the_expression_tree.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,198 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Transforming the Expression Tree</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../examples.html" title="Advanced Examples">
-<link rel="prev" href="adding_an_expression.html" title="Adding an expression">
-<link rel="next" href="../wrap_up.html" title="Wrap Up">
-</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="adding_an_expression.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../wrap_up.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.examples.transforming_the_expression_tree"></a><a class="link" href="transforming_the_expression_tree.html" title="Transforming the Expression Tree">Transforming
-      the Expression Tree</a>
-</h3></div></div></div>
-<p>
-        This example will show how to write <a class="link" href="../inside/actions.html" title="More on Actions">Actions</a>
-        that transform the Phoenix AST.
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          "<span class="emphasis"><em>Lisp macros transform the program structure itself, with
-          the full language available to express such transformations.</em></span>"
-        </p>
-<p>
-          Wikipedia
-        </p>
-</blockquote></div>
-<p>
-        What we want to do is to invert some arithmetic operators, i.e. plus will
-        be transformed to minus, minus to plus, multiplication to division and division
-        to multiplication.
-      </p>
-<p>
-        Let's start with defining our default action:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">invert_actions</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Rule</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">when</span>
-        <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span> <span class="comment">// the default is proto::_</span>
-    <span class="special">{};</span>
-<span class="special">};</span>
-</pre>
-<p>
-        By default, we don't want to do anything, well, not exactly nothing, but
-        just return the expression. This is done by proto::_
-        which, used as a transform, just passes the current expression along. Making
-        this action an identity transform.
-      </p>
-<p>
-        So, after the basics are set up, we can start by writing the transformations
-        we want to have on our tree:
-      </p>
-<pre class="programlisting"><span class="comment">// Transform plus to minus</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        Wow, this looks complicated! Granted you need to know a little bit about
-        Boost.Proto
-        (For a good introduction read through the <a href="http://cpp-next.com/archive/2010/08/expressive-c-introduction/" target="_top">Expressive
-        C++</a> series).
-      </p>
-<p>
-        What is done is the following:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            The left expression is passed to evaluator (with the current context,
-            that contains our invert_actions)
-          </li>
-<li class="listitem">
-            The right expression is passed to evaluator (with the current context,
-            that contains our invert_actions)
-          </li>
-<li class="listitem">
-            The result of these two <a href="http://www.boost.org/doc/libs/release/doc/html/Transform.html" target="_top">Proto
-            Transforms</a> is passed to proto::functional::make_expr which returns the
-            freshly created expression
-          </li>
-</ul></div>
-<p>
-        After you know what is going on, maybe the rest doesn't look so scary anymore:
-      </p>
-<pre class="programlisting"><span class="comment">// Transform minus to plus</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-
-<span class="comment">// Transform multiplies to divides</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-
-<span class="comment">// Transform divides to multiplies</span>
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">invert_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&gt;</span>
-    <span class="special">:</span> proto::call<span class="special">&lt;</span>
-        proto::functional::make_expr<span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&gt;(</span>
-            <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_left</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_right</span><span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">_context</span><span class="special">)</span>
-        <span class="special">)</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        That's it! Now that we have our actions defined, we want to evaluate some
-        of our expressions with them:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="comment">// Calculate the result type: our transformed AST</span>
-<span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">&lt;</span>
-    <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">evaluator</span><span class="special">(</span>
-        <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&amp;</span>
-      <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">context</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">invert_actions</span><span class="special">&gt;::</span><span class="identifier">type</span>
-    <span class="special">)</span>
-<span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">Expr</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">expr</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span>
-        <span class="comment">// Evaluate it with our actions</span>
-        <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">eval</span><span class="special">(</span>
-            <span class="identifier">expr</span>
-          <span class="special">,</span> <span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">context</span><span class="special">(</span>
-                <span class="keyword">int</span><span class="special">()</span>
-              <span class="special">,</span> <span class="identifier">invert_actions</span><span class="special">()</span>
-            <span class="special">)</span>
-        <span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Run some tests to see if it is working:
-      </p>
-<pre class="programlisting"><span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span><span class="special">);</span>                    <span class="comment">// --&gt; _1</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">_2</span><span class="special">);</span>               <span class="comment">// --&gt; _1 - _2</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 - _2 + _3</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span><span class="special">);</span>               <span class="comment">// --&gt; _1 / _2</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span> <span class="special">/</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 / _2 * _3</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span> <span class="special">+</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 / _2 - _3</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">);</span>          <span class="comment">// --&gt; _1 / _2 + _2</span>
-<span class="identifier">invert</span><span class="special">(</span><span class="identifier">if_</span><span class="special">(</span><span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">_4</span><span class="special">)[</span><span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">]);</span> <span class="comment">// --&gt; if_(_1 / _4)[_2 + _3]</span>
-<span class="identifier">_1</span> <span class="special">*</span> <span class="identifier">invert</span><span class="special">(</span><span class="identifier">_2</span> <span class="special">-</span> <span class="identifier">_3</span><span class="special">));</span>         <span class="comment">// --&gt; _1 * _2 + _3</span>
-</pre>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/note.png" alt="note"></span> The complete example can be found here: example/invert.cpp
-      </p>
-<p>
-        <span class="emphasis"><em>Pretty simple ...</em></span>
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adding_an_expression.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../wrap_up.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,59 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Inside Phoenix</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="modules/stl/algorithm.html" title="Algorithm">
-<link rel="next" href="inside/actor.html" title="Actors in Detail">
-</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="modules/stl/algorithm.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inside/actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.inside"></a><a class="link" href="inside.html" title="Inside Phoenix">Inside Phoenix</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Actors in Detail</span></dt>
-<dt><span class="section">Phoenix Expressions</span></dt>
-<dd><dl><dt><span class="section"><a href="inside/expression/boilerplate_macros.html">Boilerplate
-        Macros</a></span></dt></dl></dd>
-<dt><span class="section">More on Actions</span></dt>
-<dt><span class="section">Predefined Expressions and Rules</span></dt>
-<dt><span class="section">Custom Terminals</span></dt>
-<dt><span class="section">Placeholder Unification</span></dt>
-</dl></div>
-<p>
-      This chapter explains in more detail how the library operates. The information
-      henceforth should not be necessary to those who are interested in just using
-      the library. However, a microscopic view might prove to be beneficial to advanced
-      programmers who wish to extend the library.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="modules/stl/algorithm.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inside/actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,209 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>More on Actions</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="expression/boilerplate_macros.html" title="Boilerplate Macros">
-<link rel="next" href="rules.html" title="Predefined Expressions and Rules">
-</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="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rules.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.actions"></a><a class="link" href="actions.html" title="More on Actions">More on Actions</a>
-</h3></div></div></div>
-<p>
-        As you know from the <a class="link" href="actor.html" title="Actors in Detail">Actors in Detail</a>
-        section, Actions are what brings life to a Phoenix expression tree.
-      </p>
-<p>
-        When dealing with a Phoenix expression tree, it gets evaluated top-down.
-        Example:
-      </p>
-<pre class="programlisting"><span class="identifier">_1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">*</span> <span class="identifier">_2</span>
-</pre>
-<p>
-        Can be visualized as an AST in the following way:
-      </p>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/simple_ast.png" alt="simple_ast"></span>
-      </p>
-<p>
-        In terms of actions this means:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span></code> is matched
-          </li>
-<li class="listitem">
-            evaluate left:
-            <div class="itemizedlist"><ul class="itemizedlist" type="circle"><li class="listitem">
-                  <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">placeholder</span></code> is matched
-                </li></ul></div>
-          </li>
-<li class="listitem">
-            evaluate right:
-            <div class="itemizedlist"><ul class="itemizedlist" type="circle"><li class="listitem">
-                  <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies</span></code> is matched
-                  <div class="itemizedlist"><ul class="itemizedlist" type="square">
-<li class="listitem">
-                        evaluate left:
-                        <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-                              <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">value</span></code>
-                              is matched
-                            </li></ul></div>
-                      </li>
-<li class="listitem">
-                        evaluate right:
-                        <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-                              <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">placeholder</span></code>
-                              is matched
-                            </li></ul></div>
-                      </li>
-</ul></div>
-                </li></ul></div>
-          </li>
-</ul></div>
-<p>
-        Every time a rule is matched, an action will be called. The action determines
-        how the Phoenix AST will be traversed.
-      </p>
-<h5>
-<a name="phoenix.inside.actions.h0"></a>
-        <span><a name="phoenix.inside.actions.writing_an_action"></a></span><a class="link" href="actions.html#phoenix.inside.actions.writing_an_action">Writing
-        an Action</a>
-      </h5>
-<p>
-        As mentioned in <a class="link" href="actor.html" title="Actors in Detail">Actors in Detail</a>
-        actions are <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-        Primitive Transforms</a> for convenience Phoenix provides an abstraction
-        to this:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Fun</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">call</span><span class="special">;</span>
-</pre>
-<p>
-        This is similar to proto::call but does more. It calls the
-        <code class="computeroutput"><span class="identifier">Fun</span></code> function object passed
-        as template parameter with the <code class="computeroutput"><span class="identifier">Context</span></code>
-        and the children of the expression associated with the rule.
-      </p>
-<p>
-        Lets have an (simplified) example on how to write an evaluation action for
-        <code class="computeroutput"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span></code>:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">plus_eval</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="keyword">int</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-    <span class="identifier">result_type</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Lhs</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">Rhs</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="identifier">rhs</span><span class="special">,</span> <span class="identifier">Context</span> <span class="special">&amp;</span> <span class="identifier">ctx</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">eval</span><span class="special">(</span><span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">eval</span><span class="special">(</span><span class="identifier">rhs</span><span class="special">,</span> <span class="identifier">ctx</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">default_actions</span><span class="special">::</span><span class="identifier">when</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;</span>
-    <span class="special">:</span> <span class="identifier">call</span><span class="special">&lt;</span><span class="identifier">plus_eval</span><span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        That's it. When evaluating a <code class="computeroutput"><span class="identifier">plus</span></code>
-        expression, the <code class="computeroutput"><span class="identifier">plus_eval</span></code>
-        callable gets called with the left hand side and right hand side expression
-        and the associated Context.
-      </p>
-<p>
-        <span class="bold"><strong>But there is more:</strong></span> As Actions <span class="emphasis"><em>can</em></span>
-        be full fletched <a href="http://www.boost.org/doc/libs/release/doc/html/Transform.html" target="_top">Proto
-        Transforms</a>, you can in fact use any proto expression you can imagine
-        as the action. Phoenix predifines a set of callables and transform to deal
-        with the Context information passed along and of course every Phoenix expression
-        can be used as a Phoenix grammar or <a href="http://www.boost.org/doc/libs/release/doc/html/boost/proto/pass_through.html" target="_top">Proto
-        Pass Through Transform</a>.
-      </p>
-<div class="variablelist">
-<p class="title"><b></b></p>
-<dl>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">functional</span><span class="special">::</span><span class="identifier">context</span><span class="special">(</span><span class="identifier">Env</span><span class="special">,</span> <span class="identifier">Actions</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/Callable.html" target="_top">Proto
-              Callable Transform</a> that creates a new context out of the <code class="computeroutput"><span class="identifier">Env</span></code> and <code class="computeroutput"><span class="identifier">Actions</span></code>
-              parameter
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">functional</span><span class="special">::</span><span class="identifier">env</span><span class="special">(</span><span class="identifier">Context</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/Callable.html" target="_top">Proto
-              Callable Transform</a> that returns the environment out of the
-              <code class="computeroutput"><span class="identifier">Context</span></code> parameter
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">functional</span><span class="special">::</span><span class="identifier">actions</span><span class="special">(</span><span class="identifier">Context</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/Callable.html" target="_top">Proto
-              Callable Transform</a> that returns the actions out of the <code class="computeroutput"><span class="identifier">Context</span></code> parameter
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">_context</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-              Primitive Transform</a> that returns the current context
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">_env</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-              Primitive Transform</a> that returns the current environment
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">_actions</span></code></span></dt>
-<dd><p>
-              A <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-              Primitive Transform</a> that returns the current actions
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">context</span><span class="special">(</span><span class="identifier">env</span><span class="special">,</span> <span class="identifier">actions</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A regular function that creates a context
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">env</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A regular function that returns the environment from the given context
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">actions</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code></span></dt>
-<dd><p>
-              A regular function that returns the actions from the given context
-            </p></dd>
-</dl>
-</div>
-<p>
-        Phoenix is equipped with a predefined set of expressions, rules and actions
-        to make all the stuff work you learned in the <a class="link" href="../starter_kit.html" title="Starter Kit">Starter
-        Kit</a> and <a class="link" href="../modules.html" title="Modules">Modules</a> sections. See
-        the <a class="link" href="rules.html" title="Predefined Expressions and Rules">next section</a> for more details!
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rules.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/actor.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,411 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Actors in Detail</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="../inside.html" title="Inside Phoenix">
-<link rel="next" href="expression.html" title="Phoenix Expressions">
-</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="../inside.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.actor"></a><a class="link" href="actor.html" title="Actors in Detail">Actors in Detail</a>
-</h3></div></div></div>
-<h5>
-<a name="phoenix.inside.actor.h0"></a>
-        <span><a name="phoenix.inside.actor.actor"></a></span><a class="link" href="actor.html#phoenix.inside.actor.actor">Actor</a>
-      </h5>
-<p>
-        The main concept is the <code class="computeroutput"><span class="identifier">Actor</span></code>.
-        An <code class="computeroutput"><span class="identifier">Actor</span></code> is a model of the
-        <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> concept (that can accept 0 to N arguments (where
-        N is a predefined maximum).
-      </p>
-<p>
-        An <code class="computeroutput"><span class="identifier">Actor</span></code> contains a valid
-        Phoenix Expression, a call to one of the function call operator overloads,
-        starts the evaluation process.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>,
-          the predefined maximum arity an actor can take. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code> is set to 10.
-        </p></td></tr>
-</table></div>
-<p>
-        The <code class="computeroutput"><span class="identifier">actor</span></code> template class
-        models the <code class="computeroutput"><span class="identifier">Actor</span></code> concept:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">actor</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-    <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;::</span><span class="identifier">type</span>
-    <span class="keyword">operator</span><span class="special">()()</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span> <span class="identifier">T0</span> <span class="special">&amp;&gt;::</span><span class="identifier">type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span> <span class="identifier">T0</span> <span class="keyword">const</span> <span class="special">&amp;&gt;::</span><span class="identifier">type</span>
-    <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">_0</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
-    <span class="comment">//...</span>
-<span class="special">};</span>
-</pre>
-<div class="table">
-<a name="phoenix.inside.actor.t0"></a><p class="title"><b>Table&#160;1.9.&#160;Actor Concept Requirements</b></p>
-<div class="table-contents"><table class="table" summary="Actor Concept Requirements">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">actor</span><span class="special">(</span><span class="identifier">arg0</span><span class="special">,</span>
-                  <span class="identifier">arg1</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">argN</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Function call operators to start the evaluation
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">&lt;</span><span class="identifier">Actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">&gt;(</span><span class="identifier">Arg0</span><span class="special">,</span>
-                  <span class="identifier">Arg1</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">ArgN</span><span class="special">)&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Result of the evaluation
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span>
-                  <span class="identifier">Arg0</span><span class="special">,</span>
-                  <span class="identifier">Arg1</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">ArgN</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Result of the evaluation
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><h5>
-<a name="phoenix.inside.actor.h1"></a>
-        <span><a name="phoenix.inside.actor.function_call_operators"></a></span><a class="link" href="actor.html#phoenix.inside.actor.function_call_operators">Function
-        Call Operators</a>
-      </h5>
-<p>
-        There are 2*N function call operators for 0 to N arguments (N == <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>). The actor class accepts
-        the arguments and forwards the arguments to the default evaluation action.
-      </p>
-<p>
-        Additionally, there exist function call operators accepting permutations
-        of const and non-const references. These operators are created for all N
-        &lt;= <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_PERFECT_FORWARD_LIMIT</span></code>
-        (which defaults to 3).
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top">
-<p>
-          <span class="bold"><strong>Forwarding Function Problem</strong></span>
-        </p>
-<p>
-          There is a known issue with current C++ called the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
-          Function Problem</a>". The problem is that given an arbitrary
-          function <code class="computeroutput"><span class="identifier">F</span></code>, using current
-          C++ language rules, one cannot create a forwarding function <code class="computeroutput"><span class="identifier">FF</span></code> that transparently assumes the arguments
-          of <code class="computeroutput"><span class="identifier">F</span></code>.
-        </p>
-</td></tr>
-</table></div>
-<h5>
-<a name="phoenix.inside.actor.h2"></a>
-        <span><a name="phoenix.inside.actor.context"></a></span><a class="link" href="actor.html#phoenix.inside.actor.context">Context</a>
-      </h5>
-<p>
-        On an actor function call, before calling the evaluation function, the actor
-        created a <span class="bold"><strong>context</strong></span>. This context consists
-        of an <code class="computeroutput"><span class="identifier">Environment</span></code> and an
-        <code class="computeroutput"><span class="identifier">Action</span></code> part. These contain
-        all information necessary to evaluate the given expression.
-      </p>
-<div class="table">
-<a name="phoenix.inside.actor.t1"></a><p class="title"><b>Table&#160;1.10.&#160;Context Concept Requirements</b></p>
-<div class="table-contents"><table class="table" summary="Context Concept Requirements">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">context</span><span class="special">&lt;</span><span class="identifier">Env</span><span class="special">,</span>
-                  <span class="identifier">Actions</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Type of a Context
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">context</span><span class="special">(</span><span class="identifier">e</span><span class="special">,</span>
-                  <span class="identifier">a</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  A Context containing environment <code class="computeroutput"><span class="identifier">e</span></code>
-                  and actions <code class="computeroutput"><span class="identifier">a</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">env</span><span class="special">&lt;</span><span class="identifier">Context</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Type of the contained Environment
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">env</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  The environment
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actions</span><span class="special">&lt;</span><span class="identifier">Context</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Type of the contained Actions
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">actions</span><span class="special">(</span><span class="identifier">ctx</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  The actions
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><h5>
-<a name="phoenix.inside.actor.h3"></a>
-        <span><a name="phoenix.inside.actor.environment"></a></span><a class="link" href="actor.html#phoenix.inside.actor.environment">Environment</a>
-      </h5>
-<p>
-        The Environment is a model of <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/sequence/concepts/random_access_sequence.html" target="_top">Random
-        Access Sequence</a>.
-      </p>
-<p>
-        The arguments passed to the actor's function call operator are collected
-        inside the Environment:
-      </p>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/funnel_in.png" alt="funnel_in"></span>
-      </p>
-<p>
-        Other parts of the library (e.g. the scope module) extends the <code class="computeroutput"><span class="identifier">Environment</span></code> concept to hold other information
-        such as local variables, etc.
-      </p>
-<h5>
-<a name="phoenix.inside.actor.h4"></a>
-        <span><a name="phoenix.inside.actor.actions"></a></span><a class="link" href="actor.html#phoenix.inside.actor.actions">Actions</a>
-      </h5>
-<p>
-        Actions is the part of Phoenix which are responsible for giving the actual
-        expressions a specific behaviour. During the traversal of the Phoenix Expression
-        Tree these actions are called whenever a specified rule in the grammar matches.
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">actions</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Rule</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">when</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-        The nested <code class="computeroutput"><span class="identifier">when</span></code> template
-        is required to be <a href="http://www.boost.org/doc/libs/release/doc/html/PrimitiveTransform.html" target="_top">Proto
-        Primitive Transform</a>. No worries, you don't have to learn Boost.Proto
-        just yet! Phoenix provides some wrappers to let you define simple actions
-        without the need to dive deep into proto.
-      </p>
-<p>
-        Phoenix ships with a predefined <code class="computeroutput"><span class="identifier">default_actions</span></code>
-        class that evaluates the expressions with C++ semantics:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">default_actions</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Rule</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Dummy</span> <span class="special">=</span> <span class="keyword">void</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">when</span>
-        <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">_default</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">};</span>
-</pre>
-<p>
-        For more information on how to use the default_actions class and how to attach
-        custom actions to the evaluation process, see <a class="link" href="actions.html" title="More on Actions">more
-        on actions</a>.
-      </p>
-<h5>
-<a name="phoenix.inside.actor.h5"></a>
-        <span><a name="phoenix.inside.actor.evaluation"></a></span><a class="link" href="actor.html#phoenix.inside.actor.evaluation">Evaluation</a>
-      </h5>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">evaluator</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-    <span class="emphasis"><em>unspecified</em></span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Expr</span> <span class="special">&amp;,</span> <span class="identifier">Context</span> <span class="special">&amp;);</span>
-<span class="special">};</span>
-
-<span class="identifier">evaluator</span> <span class="keyword">const</span> <span class="identifier">eval</span> <span class="special">=</span> <span class="special">{};</span>
-</pre>
-<p>
-        The evaluation of a Phoenix expression is started by a call to the function
-        call operator of <code class="computeroutput"><span class="identifier">evaluator</span></code>.
-      </p>
-<p>
-        The evaluator is called by the <code class="computeroutput"><span class="identifier">actor</span></code>
-        function operator overloads after the context is built up. For reference,
-        here is a typical <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code>
-        that accepts two arguments:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span><span class="special">&lt;</span><span class="identifier">Expr</span><span class="special">,</span> <span class="identifier">T0</span> <span class="special">&amp;,</span> <span class="identifier">T1</span> <span class="special">&amp;&gt;::</span><span class="identifier">type</span>
-<span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span> <span class="special">&amp;</span><span class="identifier">t0</span><span class="special">,</span> <span class="identifier">T1</span> <span class="special">&amp;</span><span class="identifier">t1</span><span class="special">)</span> <span class="keyword">const</span>
-<span class="special">{</span>
-    <span class="identifier">fusion</span><span class="special">::</span><span class="identifier">vector2</span><span class="special">&lt;</span><span class="identifier">T0</span> <span class="special">&amp;,</span> <span class="identifier">T1</span> <span class="special">&amp;&gt;</span> <span class="identifier">env</span><span class="special">(</span><span class="identifier">t0</span><span class="special">,</span> <span class="identifier">t1</span><span class="special">);</span>
-
-    <span class="keyword">return</span> <span class="identifier">eval</span><span class="special">(*</span><span class="keyword">this</span><span class="special">,</span> <span class="identifier">context</span><span class="special">(</span><span class="identifier">env</span><span class="special">,</span> <span class="identifier">default_actions</span><span class="special">()));</span>
-<span class="special">}</span>
-</pre>
-<h5>
-<a name="phoenix.inside.actor.h6"></a>
-        <span><a name="phoenix.inside.actor.result_of__actor"></a></span><a class="link" href="actor.html#phoenix.inside.actor.result_of__actor">result_of::actor</a>
-      </h5>
-<p>
-        For reasons of symmetry to the family of <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> there is a special metafunction usable
-        for actor result type calculation named <code class="computeroutput"><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">actor</span></code>.
-        This metafunction allows us to directly specify the types of the parameters
-        to be passed to the <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> function. Here's a typical <code class="computeroutput"><span class="identifier">actor_result</span></code> that accepts two arguments:
-      </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">actor</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="identifier">fusion</span><span class="special">::</span><span class="identifier">vector2</span><span class="special">&lt;</span><span class="identifier">T0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">&gt;</span>                                           <span class="identifier">env_tpe</span><span class="special">;</span>
-        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">result_of</span><span class="special">::</span><span class="identifier">context</span><span class="special">&lt;</span><span class="identifier">env_type</span><span class="special">,</span> <span class="identifier">default_actions</span><span class="special">&gt;::</span><span class="identifier">type</span>      <span class="identifier">ctx_type</span>
-        <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">&lt;</span><span class="identifier">evaluator</span><span class="special">(</span><span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&amp;,</span> <span class="identifier">ctx_type</span><span class="special">)&gt;::</span><span class="identifier">type</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-<span class="special">}</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../inside.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/custom_terminals.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Custom Terminals</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="rules.html" title="Predefined Expressions and Rules">
-<link rel="next" href="placeholder_unification.html" title="Placeholder Unification">
-</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="rules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="placeholder_unification.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.custom_terminals"></a><a class="link" href="custom_terminals.html" title="Custom Terminals">Custom Terminals</a>
-</h3></div></div></div>
-<p>
-        Custom Terminals are used in Phoenix to handle special values transparently.
-        For example, as Phoenix captures everything by value, we needed to use <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span></code> to bring reference semantics
-        into Phoenix.
-      </p>
-<p>
-        Custom terminals could be any wrapper class:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">is_custom_terminal</span><span class="special">;</span>
-</pre>
-<p>
-        needs to be specialized in order for Phoenix to recognize this wrapper type.
-        <code class="computeroutput"><span class="identifier">default_action</span></code> calls <code class="computeroutput"><span class="identifier">custom_terminal</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code>.
-      </p>
-<p>
-        Example:
-      </p>
-<pre class="programlisting"><span class="comment">// Call out boost::reference_wrapper for special handling</span>
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">is_custom_terminal</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-  <span class="special">:</span> <span class="identifier">mpl</span><span class="special">::</span><span class="identifier">true_</span>
-<span class="special">{};</span>
-
-<span class="comment">// Special handling for boost::reference_wrapper</span>
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">custom_terminal</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="identifier">T</span> <span class="special">&amp;</span><span class="identifier">result_type</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Context</span><span class="special">&gt;</span>
-    <span class="identifier">T</span> <span class="special">&amp;</span><span class="keyword">operator</span><span class="special">()(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reference_wrapper</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">Context</span> <span class="special">&amp;)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">r</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="rules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="placeholder_unification.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,273 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Phoenix Expressions</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="actor.html" title="Actors in Detail">
-<link rel="next" href="expression/boilerplate_macros.html" title="Boilerplate Macros">
-</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="actor.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.expression"></a><a class="link" href="expression.html" title="Phoenix Expressions">Phoenix Expressions</a>
-</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="expression/boilerplate_macros.html">Boilerplate
-        Macros</a></span></dt></dl></div>
-<p>
-        A Phoenix Expression is a model of the <a href="http://www.boost.org/doc/libs/release/doc/html/Expr.html" target="_top">Proto
-        Expression</a> Concept. These expressions are wrapped inside an <a class="link" href="actor.html" title="Actors in Detail">Actor</a> template. The <code class="computeroutput"><span class="identifier">actor</span></code>
-        provides the function call operator which evaluates the expressions. The
-        <code class="computeroutput"><span class="identifier">actor</span></code> is the domain specific
-        wrapper around Phoenix expressions.
-      </p>
-<p>
-        By design, Phoenix Expressions do not carry any information on how they will
-        be evaluated later on. They are the data structure on which the <code class="computeroutput"><span class="identifier">Actions</span></code> will work.
-      </p>
-<p>
-        The library provides a convenience template to define expressions:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span><span class="special">&gt;</span> <span class="identifier">Actor</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">expr_ext</span>
-    <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">transform</span><span class="special">&lt;</span><span class="identifier">expr_ext</span><span class="special">&lt;</span><span class="identifier">Actor</span><span class="special">,</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">A1</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="emphasis"><em>unspecified</em></span> <span class="identifier">base_expr</span><span class="special">;</span>
-    <span class="keyword">typedef</span> <span class="identifier">Actor</span><span class="special">&lt;</span><span class="identifier">base_expr</span><span class="special">&gt;</span> <span class="identifier">type</span><span class="special">;</span>
-
-    <span class="keyword">typedef</span> <span class="emphasis"><em>unspecified</em></span> <span class="identifier">proto_grammar</span><span class="special">;</span>
-
-    <span class="keyword">static</span> <span class="identifier">type</span> <span class="identifier">make</span><span class="special">(</span><span class="identifier">A0</span> <span class="identifier">a0</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">A1</span> <span class="identifier">a1</span><span class="special">);</span>
-<span class="special">};</span>
-
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">expr</span> <span class="special">:</span> <span class="identifier">expr_ext</span><span class="special">&lt;</span><span class="identifier">actor</span><span class="special">,</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="identifier">A0</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">A1</span><span class="special">&gt;</span> <span class="special">{};</span>
-</pre>
-<p>
-        <span class="bold"><strong>Notation</strong></span>
-      </p>
-<div class="variablelist">
-<p class="title"><b></b></p>
-<dl>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span></code></span></dt>
-<dd><p>
-              Child node types
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">a0</span><span class="special">...</span><span class="identifier">aN</span></code></span></dt>
-<dd><p>
-              Child node objects
-            </p></dd>
-<dt><span class="term"><code class="computeroutput"><span class="identifier">G0</span><span class="special">...</span><span class="identifier">GN</span></code></span></dt>
-<dd><p>
-              Boost.Proto
-              grammar types
-            </p></dd>
-</dl>
-</div>
-<p>
-        <span class="bold"><strong>Expression Semantics</strong></span>
-      </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Semantics
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">Tag</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  The type of Expression having tag <code class="computeroutput"><span class="identifier">Tag</span></code>
-                  and <code class="computeroutput"><span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span></code> children
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">Tag</span><span class="special">,</span>
-                  <span class="identifier">G0</span><span class="special">...</span><span class="identifier">GN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  A Boost.Proto
-                  grammar and <a href="http://www.boost.org/doc/libs/release/doc/html/boost/proto/pass_through.html" target="_top">Proto
-                  Pass Through Transform</a>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">Tag</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">...</span><span class="identifier">AN</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">a0</span><span class="special">...</span><span class="identifier">aN</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  Returns a Phoenix Expression
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          You might have noticed the template template argument <code class="computeroutput"><span class="identifier">Actor</span></code>
-          used in <code class="computeroutput"><span class="identifier">expr_ext</span></code>. This
-          can be a user supplied custom Actor adding other member functions or objects
-          than the default <code class="computeroutput"><span class="identifier">actor</span></code>
-          template. See <a class="link" href="../examples/extending_actors.html" title="Extending Actors">Extending
-          Actors</a> for more details.
-        </p></td></tr>
-</table></div>
-<h5>
-<a name="phoenix.inside.expression.h0"></a>
-        <span><a name="phoenix.inside.expression.meta_grammar"></a></span><a class="link" href="expression.html#phoenix.inside.expression.meta_grammar">meta_grammar</a>
-      </h5>
-<p>
-        Defining expressions is only part of the game to make it a valid Phoenix
-        Expression. In order to use the expressions in the Phoenix domain, we need
-        to "register" them to our grammar.
-      </p>
-<p>
-        The <code class="computeroutput"><span class="identifier">meta_grammar</span></code> is a struct
-        for exactly that purpose. It is an openly extendable Boost.Proto
-        Grammar:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">meta_grammar</span>
-    <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">switch_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Dummy</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">case_</span>
-        <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">not_</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">};</span>
-</pre>
-<p>
-        As you can see, by default the <code class="computeroutput"><span class="identifier">meta_grammar</span></code>
-        matches nothing. With every <a class="link" href="../modules.html" title="Modules">Module</a>
-        you include this grammar gets extended by various expressions.
-      </p>
-<h5>
-<a name="phoenix.inside.expression.h1"></a>
-        <span><a name="phoenix.inside.expression.example"></a></span><a class="link" href="expression.html#phoenix.inside.expression.example">Example</a>
-      </h5>
-<p>
-        Define an expression:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">plus</span>
-    <span class="special">:</span> <span class="identifier">expr</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        And add it to the grammar:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&gt;</span>
-    <span class="special">:</span> <span class="identifier">enable_rule</span><span class="special">&lt;</span>
-        <span class="identifier">plus</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">meta_grammar</span>
-        <span class="special">&gt;</span>
-    <span class="special">&gt;</span>
-<span class="special">{};</span>
-</pre>
-<p>
-        Define a generator function to make the life of our potential users easier:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">plus</span><span class="special">(</span><span class="identifier">Lhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">Rhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">rhs</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">rhs</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Look if it really works:
-      </p>
-<pre class="programlisting"><span class="identifier">plus</span><span class="special">(</span><span class="number">6</span><span class="special">,</span> <span class="number">5</span><span class="special">)();</span>
-</pre>
-<p>
-        returns 11!
-      </p>
-<pre class="programlisting"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">display_expr</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="number">5</span><span class="special">,</span> <span class="number">6</span><span class="special">));</span>
-</pre>
-<p>
-        prints:
-      </p>
-<pre class="programlisting"><span class="identifier">plus</span><span class="special">(</span>
-    <span class="identifier">terminal</span><span class="special">(</span><span class="number">6</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">terminal</span><span class="special">(</span><span class="number">5</span><span class="special">)</span>
-<span class="special">)</span>
-</pre>
-<p>
-        See define_expression.cpp
-        for the full example.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          The example shown here only works because <code class="computeroutput"><span class="identifier">default_actions</span></code>
-          knows how to handle an expression having the <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">plus</span></code>
-          and two children. This is because <code class="computeroutput"><span class="identifier">default_actions</span></code>
-          uses the <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_default</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span></code>
-          transform to evaluate operators and functions. Learn more about actions
-          <a class="link" href="actions.html" title="More on Actions">here</a>.
-        </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="actor.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expression/boilerplate_macros.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/expression/boilerplate_macros.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,515 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Boilerplate Macros</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../expression.html" title="Phoenix Expressions">
-<link rel="prev" href="../expression.html" title="Phoenix Expressions">
-<link rel="next" href="../actions.html" title="More on Actions">
-</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="../expression.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../expression.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../actions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros"></a><a class="link" href="boilerplate_macros.html" title="Boilerplate Macros">Boilerplate
-        Macros</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION</span></dt>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span></dt>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span></dt>
-<dt><span class="section">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</span></dt>
-</dl></div>
-<p>
-          When having more and more expressions, you start to realize that this is
-          a very repetetive task. Phoenix provides boilerplate macros that make defining
-          Phoenix Expressions as you have seen in the <a class="link" href="../expression.html" title="Phoenix Expressions">previous
-          section</a> look like a piece of cake.
-        </p>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression" title="BOOST_PHOENIX_DEFINE_EXPRESSION">BOOST_PHOENIX_DEFINE_EXPRESSION</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            The sequence of <code class="computeroutput"><span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span></code> declares how many children the expression
-            will have and what <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">grammar</span></code>
-            they match.
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">child_grammarN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression.example">Example</a>
-          </h6>
-<p>
-            The example from the previous section can be rewritten as:
-          </p>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">plus</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>               <span class="comment">// Lhs</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>               <span class="comment">// Rhs</span>
-<span class="special">)</span>
-
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Lhs</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Rhs</span><span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">plus</span><span class="special">(</span><span class="identifier">Lhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">Rhs</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">rhs</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span> <span class="identifier">Rhs</span><span class="special">&gt;::</span><span class="identifier">make</span><span class="special">(</span><span class="identifier">lhs</span><span class="special">,</span> <span class="identifier">rhs</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg" title="BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-    <span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">N</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            <code class="computeroutput"><span class="identifier">N</span></code> is the maximum number
-            of variable children. All but the last elements in the grammar sequence
-            are required children of the expression, and the last denotes a variable
-            number of children. The number of children an expression of this kind
-            can hold is therefor <code class="computeroutput"><span class="identifier">N</span><span class="special">-</span><span class="number">1</span></code> plus
-            the size of the sequence
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">name</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">child_grammarN</span><span class="special">&gt;</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_vararg.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_VARARG</span><span class="special">(</span>
-    <span class="special">(</span><span class="identifier">boost</span><span class="special">)(</span><span class="identifier">phoenix</span><span class="special">)(</span><span class="identifier">mem_fun_ptr</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>                <span class="comment">// Pointer to Object</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>                <span class="comment">// Member pointer</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span>                <span class="comment">// Variable number of arguments</span>
-  <span class="special">,</span> <span class="identifier">BOOST_PHOENIX_LIMIT</span>
-<span class="special">)</span>
-</pre>
-<p>
-            This defines the member function pointer operator expression as described
-            in <a class="link" href="../../modules/operator.html" title="Operator">operators</a>.
-          </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext" title="BOOST_PHOENIX_DEFINE_EXPRESSION_EXT">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span><span class="special">(</span>
-    <span class="identifier">actor</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-    <span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">N</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            The sequence of <code class="computeroutput"><span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span></code> declares how many children the expression
-            will have and what <code class="computeroutput"><span class="identifier">proto</span><span class="special">::</span><span class="identifier">grammar</span></code>
-            they match.
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr_ext</span><span class="special">&lt;</span>
-            <span class="identifier">actor</span>
-          <span class="special">,</span> <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">child_grammarN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT</span><span class="special">(</span>
-    <span class="identifier">if_actor</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">boost</span><span class="special">)(</span><span class="identifier">phoenix</span><span class="special">)(</span><span class="identifier">if_</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span> <span class="comment">// Cond</span>
-    <span class="special">(</span><span class="identifier">meta_grammar</span><span class="special">)</span> <span class="comment">// Then</span>
-<span class="special">)</span>
-</pre>
-<p>
-            This defines the if_ expression. The custom actor defines <code class="computeroutput"><span class="identifier">else_</span></code> as a member.
-          </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg"></a><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg" title="BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h0"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.description"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to create Phoenix Expressions
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h1"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.synopsis"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_DEFINE_EXPRESSION_EXT_VARARG</span><span class="special">(</span>
-    <span class="identifier">actor</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">namespace_seq</span><span class="special">)(</span><span class="identifier">name</span><span class="special">)</span>
-  <span class="special">,</span> <span class="special">(</span><span class="identifier">child_grammar0</span><span class="special">)</span>
-    <span class="special">(</span><span class="identifier">child_grammar1</span><span class="special">)</span>
-    <span class="special">...</span>
-    <span class="special">(</span><span class="identifier">child_grammarN</span><span class="special">)</span>
-  <span class="special">,</span> <span class="identifier">N</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h2"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.semantics"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates the necessary code for an expression <code class="computeroutput"><span class="identifier">name</span></code> in namespace <code class="computeroutput"><span class="identifier">namespace_seq</span></code>.
-            <code class="computeroutput"><span class="identifier">N</span></code> is the maximum number
-            of variable children. All but the last elements in the grammar sequence
-            are required children of the expression, and the last denotes a variable
-            number of children. The number of children an expression of this kind
-            can hold is therefor <code class="computeroutput"><span class="identifier">N</span><span class="special">-</span><span class="number">1</span></code> plus
-            the size of the sequence
-          </p>
-<p>
-            The macro should be used at global scope. <code class="computeroutput"><span class="identifier">namespace_seq</span></code>
-            shall be the sequence of namespaces under which the following symbols
-            will be defined:
-          </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">tag</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">expression</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">expr_ext</span><span class="special">&lt;</span>
-            <span class="identifier">actor</span>
-          <span class="special">,</span> <span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span>
-          <span class="special">,</span> <span class="identifier">A0</span>
-          <span class="special">,</span> <span class="identifier">A1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">AN</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">rule</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">name</span>
-        <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">name</span><span class="special">&lt;</span>
-            <span class="identifier">child_grammar0</span>
-          <span class="special">,</span> <span class="identifier">child_grammar1</span>
-            <span class="special">...</span>
-          <span class="special">,</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">child_grammarN</span><span class="special">&gt;</span>
-        <span class="special">&gt;</span>
-    <span class="special">{};</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">functional</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// A polymorphic function object that can be called to create the expression node</span>
-<span class="special">}</span>
-
-<span class="keyword">namespace</span> <span class="identifier">result_of</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">make_name</span><span class="special">;</span> <span class="comment">// The result type of the expression node</span>
-<span class="special">}</span>
-
-<span class="comment">// convenience polymorphic function to create an expression node</span>
-<span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="keyword">typename</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">result_of</span><span class="special">::</span><span class="identifier">make_name</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">&gt;</span>
-<span class="identifier">make_name</span><span class="special">(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span> <span class="special">...</span> <span class="identifier">AN</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">an</span><span class="special">);</span>
-</pre>
-<p>
-            This macros also adds a specialization for <code class="computeroutput"><span class="identifier">meta_grammar</span><span class="special">::</span><span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">name</span><span class="special">&gt;</span></code> to enable the rule for further use
-            in actions.
-          </p>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h3"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.header"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">expression</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.h4"></a>
-            <span><a name="phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.example"></a></span><a class="link" href="boilerplate_macros.html#phoenix.inside.expression.boilerplate_macros.boost_phoenix_define_expression_ext_vararg.example">Example</a>
-          </h6>
-<p>
-            TBD
-          </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../expression.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../expression.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../actions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/placeholder_unification.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Placeholder Unification</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="custom_terminals.html" title="Custom Terminals">
-<link rel="next" href="../examples.html" title="Advanced 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="custom_terminals.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.placeholder_unification"></a><a class="link" href="placeholder_unification.html" title="Placeholder Unification">Placeholder Unification</a>
-</h3></div></div></div>
-<p>
-        Phoenix uses <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_placeholder</span></code> for recognizing placeholders:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-<span class="keyword">struct</span> <span class="identifier">is_placeholder</span>
-<span class="special">{</span>
-    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">value</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-        To adapt your own placeholder, the nested value needs to be greater than
-        0 for your types. This is done by specializing this trait.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="custom_terminals.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/inside/rules.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,1314 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Predefined Expressions and Rules</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../inside.html" title="Inside Phoenix">
-<link rel="prev" href="actions.html" title="More on Actions">
-<link rel="next" href="custom_terminals.html" title="Custom Terminals">
-</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="actions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="custom_terminals.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside.rules"></a><a class="link" href="rules.html" title="Predefined Expressions and Rules">Predefined Expressions and Rules</a>
-</h3></div></div></div>
-<p>
-        This section is the "behind the scenes" counter part of the <a class="link" href="../modules.html" title="Modules">Modules</a> section. A listing of all the predefined
-        expressions and rules:
-      </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-              </th>
-<th>
-                <p>
-                  Rule
-                </p>
-              </th>
-<th>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">value</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">custom_terminal</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">argument</span></pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">custom_terminal</span></pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">F</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">function</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">negate</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">negate</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">unary_plus</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">unary_plus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_inc</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_inc</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_dec</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">pre_dec</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_inc</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_inc</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_dec</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">negate</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">post_dec</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">minus_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">divides_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">modules_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">modules_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">modules_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">plus</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">plus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">minus</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">minus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">multiplies</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">multiplies</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">divides</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">divides</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">modulus</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">modulus</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">modulus</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">complement</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">complement</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">complement</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_and_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_or_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_xor_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_left_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right_assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_right_assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right_assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_and</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_and</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_or</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_or</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">bitwise_xor</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">bitwise_xor</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_left</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_left</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">shift_right</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">shift_right</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">equal_to</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">not_equal_to</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">not_equal_to</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">not_equal_to</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">less_equal_to</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">less_equal_to</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">less_equal_to</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater_equal</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">greater_equal</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater_equal</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">less</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">less</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">less</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">greater</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">greater</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else_operator</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Then</span><span class="special">,</span>
-                  <span class="identifier">Else</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">if_else</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_not</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">logical_not</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_not</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_and</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">logical_and</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_and</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_or</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">logical_or</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">logical_or</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">mem_fun_ptr</span><span class="special">&lt;</span><span class="identifier">Object</span><span class="special">,</span>
-                  <span class="identifier">MemPtr</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">mem_fun_ptr</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">mem_fun_ptr</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">address_of</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">address_of</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">address_of</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">dereference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">dereference</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">dereference</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">assign</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">assign</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">assign</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">subscript</span><span class="special">&lt;</span><span class="identifier">Lhs</span><span class="special">,</span>
-                  <span class="identifier">Rhs</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">subscript</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">subscript</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">sequence</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">,</span>
-                  <span class="identifier">A1</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">sequence</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">sequence</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Then</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">if_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else_statement</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Then</span><span class="special">,</span>
-                  <span class="identifier">Else</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">if_else_statement</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">if_else_statement</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_case</span><span class="special">&lt;</span><span class="identifier">Label</span><span class="special">,</span>
-                  <span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">switch_case</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_case</span><span class="special">&lt;</span> <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">int_</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;</span> <span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_default_case</span><span class="special">&lt;</span><span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">switch_default_case</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_default_case</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Cases</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">switch_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">switch_</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">switch_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Do</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">while_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">while_</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">do_while</span><span class="special">&lt;</span><span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Do</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">do_while</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">do_while</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">for_</span><span class="special">&lt;</span><span class="identifier">Init</span><span class="special">,</span>
-                  <span class="identifier">Cond</span><span class="special">,</span>
-                  <span class="identifier">Step</span><span class="special">,</span>
-                  <span class="identifier">Do</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">for_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">for_</span><span class="special">&lt;</span>
-        <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">Exception</span><span class="special">,</span>
-                  <span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&lt;</span>
-        <span class="identifier">catch_exception</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span>
-      <span class="special">,</span> <span class="identifier">meta_grammar</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_all</span><span class="special">&lt;</span><span class="identifier">Statement</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_all</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span><span class="identifier">Try</span><span class="special">,</span>
-                  <span class="identifier">Catch0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">CatchN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">try_catch</span>
-    <span class="special">:</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">or_</span><span class="special">&lt;</span>
-        <span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&gt;</span>
-        <span class="special">&gt;</span>
-      <span class="special">,</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">vararg</span><span class="special">&lt;</span><span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_</span><span class="special">&gt;</span>
-          <span class="special">,</span> <span class="identifier">rule</span><span class="special">::</span><span class="identifier">catch_all</span>
-        <span class="special">&gt;</span>
-      <span class="special">,</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">try_catch</span><span class="special">&lt;</span>
-            <span class="identifier">meta_grammar</span>
-          <span class="special">,</span> <span class="identifier">catch_all</span>
-        <span class="special">&gt;</span>
-    <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">throw_</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">throw_</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">throw_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">construct</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">construct</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A0</span>
-       <span class="special">...</span>
-     <span class="special">,</span> <span class="identifier">AN</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A0</span><span class="special">,</span>
-                  <span class="special">...,</span> <span class="identifier">AN</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">new_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">new_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A0</span>
-       <span class="special">...</span>
-     <span class="special">,</span> <span class="identifier">AN</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">delete_</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">delete_</span>
-      <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">delete_</span><span class="special">&lt;</span><span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">static_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">static_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">dynamic_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">dynamic_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">dynamic_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reinterpret_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">reinterpret_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">reinterpret_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">const_cast_</span><span class="special">&lt;</span><span class="identifier">Target</span><span class="special">,</span>
-                  <span class="identifier">A</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">const_cast_</span>
-   <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">const_cast_</span><span class="special">&lt;</span>
-       <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">detail</span><span class="special">::</span><span class="identifier">target</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-     <span class="special">,</span> <span class="identifier">A</span>
-   <span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">custom_terminal</span></pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">let</span><span class="special">&lt;</span><span class="identifier">Locals</span><span class="special">,</span>
-                  <span class="identifier">Statement</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">let</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">let</span><span class="special">&lt;</span><span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda</span><span class="special">&lt;</span><span class="identifier">OuterEnv</span><span class="special">,</span>
-                  <span class="identifier">Locals</span><span class="special">,</span>
-                  <span class="identifier">Statement</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">lambda</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda</span><span class="special">&lt;</span><span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda_actor</span><span class="special">&lt;</span><span class="identifier">Locals</span><span class="special">,</span>
-                  <span class="identifier">Statement</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rule</span><span class="special">::</span><span class="identifier">lambda_actor</span>
-    <span class="special">:</span> <span class="identifier">expression</span><span class="special">::</span><span class="identifier">lambda_actor</span><span class="special">&lt;</span><span class="identifier">terminal</span><span class="special">&lt;</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">&gt;,</span> <span class="identifier">meta_grammar</span><span class="special">&gt;</span>
-</pre>
-<p>
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="actions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inside.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="custom_terminals.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/introduction.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/introduction.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,70 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="what_s_new/phoenix_3_0.html" title="Phoenix 3.0">
-<link rel="next" href="starter_kit.html" title="Starter Kit">
-</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="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
-</h2></div></div></div>
-<p>
-      <span class="inlinemediaobject"><img src="../images/banner.png" alt="banner"></span>
-    </p>
-<p>
-      The Phoenix library enables FP techniques such as higher order functions,
-      <span class="emphasis"><em>lambda</em></span> (unnamed functions), <span class="emphasis"><em>currying</em></span>
-      (partial function application) and lazy evaluation in C++. The focus is more
-      on usefulness and practicality than purity, elegance and strict adherence to
-      FP principles.
-    </p>
-<p>
-      FP is a programming discipline that is not at all tied to a specific language.
-      FP as a programming discipline can, in fact, be applied to many programming
-      languages. In the realm of C++ for instance, we are seeing more FP techniques
-      being applied. C++ is sufficiently rich to support at least some of the most
-      important facets of FP. C++ is a multiparadigm programming language. It is
-      not only procedural. It is not only object oriented. Beneath the core of the
-      standard C++ library, a closer look into STL gives us a glimpse of FP already
-      in place. It is obvious that the authors of STL know and practice FP. In the
-      near future, we shall surely see more FP trickle down into the mainstream.
-    </p>
-<p>
-      The truth is, most of the FP techniques can coexist quite well with the standard
-      object oriented and imperative programming paradigms. When we are using STL
-      algorithms and functors (function objects) for example, we are already doing
-      FP. Phoenix is an evolutionary next step.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,101 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Modules</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="actor.html" title="Actor">
-<link rel="next" href="modules/core.html" title="Core">
-</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="actor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules/core.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.modules"></a><a class="link" href="modules.html" title="Modules">Modules</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Core</span></dt>
-<dd><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Nothing</span></dt>
-</dl></dd>
-<dt><span class="section">Function</span></dt>
-<dd><dl><dt><span class="section"><a href="modules/function/adapting_functions.html">Adapting
-        Functions</a></span></dt></dl></dd>
-<dt><span class="section">Operator</span></dt>
-<dt><span class="section">Statement</span></dt>
-<dd><dl>
-<dt><span class="section">Block Statement</span></dt>
-<dt><span class="section">if_ Statement</span></dt>
-<dt><span class="section">if_else_ Statement</span></dt>
-<dt><span class="section"><a href="modules/statement/switch__statement.html">switch_
-        Statement</a></span></dt>
-<dt><span class="section"><a href="modules/statement/while__statement.html">while_
-        Statement</a></span></dt>
-<dt><span class="section">do_while_ Statement</span></dt>
-<dt><span class="section">for_ Statement</span></dt>
-<dt><span class="section"><a href="modules/statement/try__catch__statement.html">try_
-        catch_ Statement</a></span></dt>
-<dt><span class="section">throw_</span></dt>
-</dl></dd>
-<dt><span class="section">Object</span></dt>
-<dd><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section">New</span></dt>
-<dt><span class="section">Delete</span></dt>
-<dt><span class="section">Casts</span></dt>
-</dl></dd>
-<dt><span class="section">Scope</span></dt>
-<dd><dl>
-<dt><span class="section">Local Variables</span></dt>
-<dt><span class="section">let</span></dt>
-<dt><span class="section">lambda</span></dt>
-</dl></dd>
-<dt><span class="section">Bind</span></dt>
-<dd><dl>
-<dt><span class="section"><a href="modules/bind/binding_function_objects.html">Binding
-        Function Objects</a></span></dt>
-<dt><span class="section">Binding Functions</span></dt>
-<dt><span class="section"><a href="modules/bind/binding_member_functions.html">Binding
-        Member Functions</a></span></dt>
-<dt><span class="section"><a href="modules/bind/binding_member_variables.html">Binding
-        Member Variables</a></span></dt>
-<dt><span class="section"><a href="modules/bind/compatibility_with_boost_bind.html">Compatibility
-        with Boost.Bind</a></span></dt>
-</dl></dd>
-<dt><span class="section">STL</span></dt>
-<dd><dl>
-<dt><span class="section">Container</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-</dl></dd>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="actor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modules/core.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Bind</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="scope/lambda.html" title="lambda">
-<link rel="next" href="bind/binding_function_objects.html" title="Binding Function Objects">
-</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="scope/lambda.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bind/binding_function_objects.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.bind"></a><a class="link" href="bind.html" title="Bind">Bind</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="bind/binding_function_objects.html">Binding
-        Function Objects</a></span></dt>
-<dt><span class="section">Binding Functions</span></dt>
-<dt><span class="section"><a href="bind/binding_member_functions.html">Binding
-        Member Functions</a></span></dt>
-<dt><span class="section"><a href="bind/binding_member_variables.html">Binding
-        Member Variables</a></span></dt>
-<dt><span class="section"><a href="bind/compatibility_with_boost_bind.html">Compatibility
-        with Boost.Bind</a></span></dt>
-</dl></div>
-<p>
-        <span class="emphasis"><em>Binding</em></span> is the act of tying together a function to some
-        arguments for deferred (lazy) evaluation. Named <a class="link" href="function.html" title="Function">lazy
-        functions</a> require a bit of typing. Unlike (unnamed) lambda expressions,
-        we need to write a functor somewhere offline, detached from the call site.
-        If you wish to transform a plain function, member function or member variable
-        to a lambda expression, <code class="computeroutput"><span class="identifier">bind</span></code>
-        is your friend.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Take note that binding functions, member functions or member variables
-          is monomorphic. Rather than binding functions, the preferred way is to
-          write true generic and polymorphic <a class="link" href="function.html" title="Function">lazy
-          functions</a>.
-        </p></td></tr>
-</table></div>
-<p>
-        There is a set of overloaded <code class="computeroutput"><span class="identifier">bind</span></code>
-        template functions. Each <code class="computeroutput"><span class="identifier">bind</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-        function generates a suitable binder object.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="scope/lambda.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bind/binding_function_objects.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_function_objects.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,56 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Function Objects</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="../bind.html" title="Bind">
-<link rel="next" href="binding_functions.html" title="Binding Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../bind.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_function_objects"></a><a class="link" href="binding_function_objects.html" title="Binding Function Objects">Binding
-        Function Objects</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_function_object</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Binding function objects serves two purposes: * Partial function application
-          * Quick adaption of already existing function objects
-        </p>
-<p>
-          In order to deduce the return type of the function object, it has to implement
-          the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-          Of</a> protocol. If the bound function object is polymorphic, the resulting
-          binding object is polymorphic.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../bind.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,69 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_function_objects.html" title="Binding Function Objects">
-<link rel="next" href="binding_member_functions.html" title="Binding Member Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_function_objects.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_functions"></a><a class="link" href="binding_functions.html" title="Binding Functions">Binding Functions</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Example, given a function <code class="computeroutput"><span class="identifier">foo</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">n</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-          Here's how the function <code class="computeroutput"><span class="identifier">foo</span></code>
-          may be bound:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>
-</pre>
-<p>
-          This is now a full-fledged expression that can finally be evaluated by
-          another function call invocation. A second function call will invoke the
-          actual <code class="computeroutput"><span class="identifier">foo</span></code> function. Example:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)(</span><span class="number">4</span><span class="special">);</span>
-</pre>
-<p>
-          will print out "4".
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_function_objects.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,72 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Member Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_functions.html" title="Binding Functions">
-<link rel="next" href="binding_member_variables.html" title="Binding Member Variables">
-</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="binding_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_variables.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_member_functions"></a><a class="link" href="binding_member_functions.html" title="Binding Member Functions">Binding
-        Member Functions</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Binding member functions can be done similarly. A bound member function
-          takes in a pointer or reference to an object as the first argument. For
-          instance, given:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">xyz</span>
-<span class="special">{</span>
-    <span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">xyz</span></code>'s <code class="computeroutput"><span class="identifier">foo</span></code>
-          member function can be bound as:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// obj is an xyz object</span>
-</pre>
-<p>
-          Take note that a lazy-member functions expects the first argument to be
-          a pointer or reference to an object. Both the object (reference or pointer)
-          and the arguments can be lazily bound. Examples:
-        </p>
-<pre class="programlisting"><span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>     <span class="comment">// arg1.foo(arg2)</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>      <span class="comment">// obj.foo(arg1)</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="number">100</span><span class="special">)</span>       <span class="comment">// obj.foo(100)</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binding_member_variables.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/binding_member_variables.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,74 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Binding Member Variables</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_member_functions.html" title="Binding Member Functions">
-<link rel="next" href="compatibility_with_boost_bind.html" title="Compatibility with Boost.Bind">
-</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="binding_member_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compatibility_with_boost_bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.binding_member_variables"></a><a class="link" href="binding_member_variables.html" title="Binding Member Variables">Binding
-        Member Variables</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Member variables can also be bound much like member functions. Member variables
-          are not functions. Yet, like the <a class="link" href="../core/references.html" title="References"><code class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code></a>
-          that acts like a nullary function returning a reference to the data, member
-          variables, when bound, act like a unary function, taking in a pointer or
-          reference to an object as its argument and returning a reference to the
-          bound member variable. For instance, given:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">xyz</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">v</span><span class="special">;</span>
-<span class="special">};</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span></code> can be bound as:
-        </p>
-<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span> <span class="comment">// obj is an xyz object</span>
-</pre>
-<p>
-          As noted, just like the bound member function, a bound member variable
-          also expects the first (and only) argument to be a pointer or reference
-          to an object. The object (reference or pointer) can be lazily bound. Examples:
-        </p>
-<pre class="programlisting"><span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>             <span class="comment">// arg1.v</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span>              <span class="comment">// obj.v</span>
-<span class="identifier">bind</span><span class="special">(&amp;</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)(</span><span class="identifier">obj</span><span class="special">)</span> <span class="special">=</span> <span class="number">4</span>    <span class="comment">// obj.v = 4</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_member_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compatibility_with_boost_bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/bind/compatibility_with_boost_bind.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Compatibility with Boost.Bind</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../bind.html" title="Bind">
-<link rel="prev" href="binding_member_variables.html" title="Binding Member Variables">
-<link rel="next" href="../stl.html" title="STL">
-</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="binding_member_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../stl.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.bind.compatibility_with_boost_bind"></a><a class="link" href="compatibility_with_boost_bind.html" title="Compatibility with Boost.Bind">Compatibility
-        with Boost.Bind</a>
-</h4></div></div></div>
-<p>
-          <code class="computeroutput"><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">bind</span></code> passes all testcases of the Boost.Bind
-          library. It is therefore completely compatible and interchangeable.
-        </p>
-<p>
-          Given the compatibility with Boost.Bind, we also assume compatibility with
-          std::tr1::bind and std::bind from the upcoming C++0x standard.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="binding_member_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bind.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../stl.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,59 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Core</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="../modules.html" title="Modules">
-<link rel="next" href="core/values.html" title="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="../modules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="core/values.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.core"></a><a class="link" href="core.html" title="Core">Core</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Nothing</span></dt>
-</dl></div>
-<p>
-        Actors are composed to create more complex actors in a tree-like hierarchy.
-        The primitives are atomic entities that are like the leaves in the tree.
-        Phoenix is extensible. New primitives can be added anytime. Right out of
-        the box, there are only a few primitives, these are all defined in the Core
-        module.
-      </p>
-<p>
-        This section shall deal with these preset primitives.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../modules.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="core/values.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/arguments.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,194 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Arguments</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="references.html" title="References">
-<link rel="next" href="nothing.html" title="Nothing">
-</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="references.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nothing.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.arguments"></a><a class="link" href="arguments.html" title="Arguments">Arguments</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">argument</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          We use an instance of:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          to represent the Nth function argument. The argument placeholder acts as
-          an imaginary data-bin where a function argument will be placed.
-        </p>
-<h6>
-<a name="phoenix.modules.core.arguments.h0"></a>
-          <span><a name="phoenix.modules.core.arguments.predefined_arguments"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.predefined_arguments">Predefined
-          Arguments</a>
-        </h6>
-<p>
-          There are a few predefined instances of <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="identifier">N</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          named <code class="computeroutput"><span class="identifier">arg1</span></code>..<code class="computeroutput"><span class="identifier">argN</span></code>, and its BLL
-          counterpart <code class="computeroutput"><span class="identifier">_1</span></code>..<code class="computeroutput"><span class="identifier">_N</span></code>. (where N is a predefined maximum).
-        </p>
-<p>
-          Here are some sample preset definitions of <code class="computeroutput"><span class="identifier">arg1</span></code>..<code class="computeroutput"><span class="identifier">argN</span></code>
-        </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">placeholders</span>
-<span class="special">{</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">arg1</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">arg2</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">3</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">arg3</span> <span class="special">=</span> <span class="special">{};</span>
-<span class="special">}</span>
-</pre>
-<p>
-          and its BLL
-          <code class="computeroutput"><span class="identifier">_1</span></code>..<code class="computeroutput"><span class="identifier">_N</span></code>
-          style counterparts:
-        </p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">placeholders</span>
-<span class="special">{</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">_1</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">2</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">_2</span> <span class="special">=</span> <span class="special">{};</span>
-    <span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">3</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="identifier">_3</span> <span class="special">=</span> <span class="special">{};</span>
-<span class="special">}</span>
-</pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ARG_LIMIT</span></code>,
-            the predefined maximum placeholder index. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ARG_LIMIT</span></code>
-            is set to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-            (See <a class="link" href="../../actor.html" title="Actor">Actor</a>).
-          </p></td></tr>
-</table></div>
-<h6>
-<a name="phoenix.modules.core.arguments.h1"></a>
-          <span><a name="phoenix.modules.core.arguments.user_defined_arguments"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.user_defined_arguments">User Defined
-          Arguments</a>
-        </h6>
-<p>
-          When appropriate, you can define your own <code class="computeroutput"><span class="identifier">argument</span></code>
-          names. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">argument</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">x</span><span class="special">;</span> <span class="comment">// note one based index</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">x</span></code> may now be used as a
-          parameter to a lazy function:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<p>
-          which is equivalent to:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.core.arguments.h2"></a>
-          <span><a name="phoenix.modules.core.arguments.evaluating_an_argument"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.evaluating_an_argument">Evaluating
-          an Argument</a>
-        </h6>
-<p>
-          An argument, when evaluated, selects the Nth argument from the those passed
-          in by the client.
-        </p>
-<p>
-          For example:
-        </p>
-<pre class="programlisting"><span class="keyword">char</span>        <span class="identifier">c</span> <span class="special">=</span> <span class="char">'A'</span><span class="special">;</span>
-<span class="keyword">int</span>         <span class="identifier">i</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
-<span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>        <span class="comment">//  Get the 1st argument: c</span>
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>     <span class="comment">//  Get the 1st argument: i</span>
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg2</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>     <span class="comment">//  Get the 2nd argument: s</span>
-</pre>
-<p>
-          will print out:
-        </p>
-<pre class="programlisting"><span class="identifier">A</span>
-<span class="number">123</span>
-<span class="identifier">Hello</span> <span class="identifier">World</span>
-</pre>
-<h6>
-<a name="phoenix.modules.core.arguments.h3"></a>
-          <span><a name="phoenix.modules.core.arguments.extra_arguments"></a></span><a class="link" href="arguments.html#phoenix.modules.core.arguments.extra_arguments">Extra
-          Arguments</a>
-        </h6>
-<p>
-          In C and C++, a function can have extra arguments that are not at all used
-          by the function body itself. These extra arguments are simply ignored.
-        </p>
-<p>
-          Phoenix also allows extra arguments to be passed. For example, recall our
-          original <code class="computeroutput"><span class="identifier">add</span></code> function:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
-</pre>
-<p>
-          We know now that partially applying this function results to a function
-          that expects 2 arguments. However, the library is a bit more lenient and
-          allows the caller to supply more arguments than is actually required. Thus,
-          <code class="computeroutput"><span class="identifier">add</span></code> actually allows 2
-          <span class="emphasis"><em>or more</em></span> arguments. For instance, with:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">,</span> <span class="identifier">z</span><span class="special">)</span>
-</pre>
-<p>
-          the third argument <code class="computeroutput"><span class="identifier">z</span></code> is
-          ignored. Taking this further, in-between arguments are also ignored. Example:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg5</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">,</span> <span class="identifier">e</span><span class="special">)</span>
-</pre>
-<p>
-          Here, arguments b, c, and d are ignored. The function <code class="computeroutput"><span class="identifier">add</span></code>
-          takes in the first argument (<code class="computeroutput"><span class="identifier">arg1</span></code>)
-          and the fifth argument (<code class="computeroutput"><span class="identifier">arg5</span></code>).
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            There are a few reasons why enforcing strict arity is not desirable.
-            A case in point is the callback function. Typical callback functions
-            provide more information than is actually needed. Lambda functions are
-            often used as callbacks.
-          </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="references.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nothing.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/nothing.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Nothing</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="arguments.html" title="Arguments">
-<link rel="next" href="../function.html" title="Function">
-</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="arguments.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../function.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.nothing"></a><a class="link" href="nothing.html" title="Nothing">Nothing</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">nothing</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Finally, the <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          does nothing; (a "bum", if you will :-) ). There's a sole <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">null</span><span class="special">&lt;</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">void_</span><span class="special">&gt;::</span><span class="identifier">type</span></code> instance named "nothing".
-          This actor is actually useful in situations where we don't want to do anything.
-          (See <a class="link" href="../statement/for_statement.html" title="for_ Statement">for_ Statement</a>
-          for example).
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="arguments.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../function.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/references.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,116 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="values.html" title="Values">
-<link rel="next" href="arguments.html" title="Arguments">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.references"></a><a class="link" href="references.html" title="References">References</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">reference</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Values are immutable constants. Attempting to modify a value will result
-          in a compile time error. When we want the function to modify the parameter,
-          we use a reference instead. For instance, imagine a lazy function <code class="computeroutput"><span class="identifier">add_assign</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">y</span><span class="special">)</span> <span class="special">{</span> <span class="identifier">x</span> <span class="special">+=</span> <span class="identifier">y</span><span class="special">;</span> <span class="special">}</span> <span class="comment">// pseudo code</span>
-</pre>
-<p>
-          Here, we want the first function argument, x, to be mutable. Obviously,
-          we cannot write:
-        </p>
-<pre class="programlisting"><span class="identifier">add_assign</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span> <span class="comment">// error first argument is immutable</span>
-</pre>
-<p>
-          In C++, we can pass in a reference to a variable as the first argument
-          in our example above. Yet, by default, the library forces arguments passed
-          to partially applied functions to be immutable values (see <a class="link" href="values.html" title="Values">Values</a>).
-          To achieve our intent, we use:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          This is similar to <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          before but instead holds a reference to a variable.
-        </p>
-<p>
-          We normally don't instantiate <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          objects directly. Instead we use:
-        </p>
-<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">v</span><span class="special">)</span>
-</pre>
-<p>
-          For example (where <code class="computeroutput"><span class="identifier">i</span></code> is
-          an <code class="computeroutput"><span class="keyword">int</span></code> variable):
-        </p>
-<pre class="programlisting"><span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">),</span> <span class="number">2</span><span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.core.references.h0"></a>
-          <span><a name="phoenix.modules.core.references.evaluating_a_reference"></a></span><a class="link" href="references.html#phoenix.modules.core.references.evaluating_a_reference">Evaluating
-          a Reference</a>
-        </h6>
-<p>
-          References are actors. Hence, references can be evaluated. Such invocation
-          gives the reference's identity. Example:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)()</span> <span class="special">&lt;&lt;</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">s</span><span class="special">)();</span>
-</pre>
-<p>
-          prints out "3 Hello World"
-        </p>
-<h6>
-<a name="phoenix.modules.core.references.h1"></a>
-          <span><a name="phoenix.modules.core.references.constant_references"></a></span><a class="link" href="references.html#phoenix.modules.core.references.constant_references">Constant
-          References</a>
-        </h6>
-<p>
-          Another free function
-        </p>
-<pre class="programlisting"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span>
-</pre>
-<p>
-          may also be used. <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code>
-          creates an <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">reference</span><span class="special">&lt;</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          object. This is similar to <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          but when the data to be passed as argument to a function is heavy and expensive
-          to copy by value, the <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code>
-          offers a lighter alternative.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/core/values.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,84 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Values</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../core.html" title="Core">
-<link rel="prev" href="../core.html" title="Core">
-<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="../core.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.core.values"></a><a class="link" href="values.html" title="Values">Values</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">value</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Whenever we see a constant in a partially applied function, an
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          (where T is the type of the constant) is automatically created for us.
-          For instance:
-        </p>
-<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<p>
-          Passing a second argument, <code class="computeroutput"><span class="number">6</span></code>,
-          an <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is implicitly created behind the
-          scenes. This is also equivalent to <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">val</span><span class="special">(</span><span class="number">6</span><span class="special">))</span></code>.
-        </p>
-<pre class="programlisting"><span class="identifier">val</span><span class="special">(</span><span class="identifier">v</span><span class="special">)</span>
-</pre>
-<p>
-          generates an <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">value</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          where <code class="computeroutput"><span class="identifier">T</span></code> is the type of
-          <code class="computeroutput"><span class="identifier">x</span></code>. In most cases, there's
-          no need to explicitly use <code class="computeroutput"><span class="identifier">val</span></code>,
-          but, as we'll see later on, there are situations where this is unavoidable.
-        </p>
-<h3>
-<a name="phoenix.modules.core.values.h0"></a>
-          <span><a name="phoenix.modules.core.values.evaluating_a_value"></a></span><a class="link" href="values.html#phoenix.modules.core.values.evaluating_a_value">Evaluating
-          a Value</a>
-        </h3>
-<p>
-          Like arguments, values are also actors. As such, values can be evaluated.
-          Invoking a value gives the value's identity. Example:
-        </p>
-<pre class="programlisting"><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"Hello World"</span><span class="special">)();</span>
-</pre>
-<p>
-          prints out "3 Hello World".
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../core.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../core.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,150 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Function</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="core/nothing.html" title="Nothing">
-<link rel="next" href="function/adapting_functions.html" title="Adapting Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="core/nothing.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="function/adapting_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.function"></a><a class="link" href="function.html" title="Function">Function</a>
-</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="function/adapting_functions.html">Adapting
-        Functions</a></span></dt></dl></div>
-<p>
-        The <code class="computeroutput"><span class="identifier">function</span></code> class template
-        provides a mechanism for implementing lazily evaluated functions. Syntactically,
-        a lazy function looks like an ordinary C/C++ function. The function call
-        looks familiar and feels the same as ordinary C++ functions. However, unlike
-        ordinary functions, the actual function execution is deferred.
-      </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-        Unlike ordinary function pointers or functor objects that need to be explicitly
-        bound through the bind function (see <a class="link" href="bind.html" title="Bind">Bind</a>),
-        the argument types of these functions are automatically lazily bound.
-      </p>
-<p>
-        In order to create a lazy function, we need to implement a model of the
-        <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> concept. For a function that takes <code class="computeroutput"><span class="identifier">N</span></code> arguments, a model of <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> must provide:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            An <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>
-            that takes <code class="computeroutput"><span class="identifier">N</span></code> arguments,
-            and implements the function logic. This is also true for ordinary function
-            pointers.
-          </li>
-<li class="listitem">
-            A nested metafunction <code class="computeroutput"><span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">Signature</span><span class="special">&gt;</span></code> or nested typedef <code class="computeroutput"><span class="identifier">result_type</span></code>,
-            following the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> Protocol
-          </li>
-</ul></div>
-<p>
-        For example, the following type implements the FunctionEval concept, in order
-        to provide a lazy factorial function:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">factorial_impl</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">Arg</span> <span class="keyword">const</span> <span class="special">&amp;)&gt;</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="identifier">Arg</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">&gt;</span>
-    <span class="identifier">Arg</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Arg</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">n</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="special">(</span><span class="identifier">n</span> <span class="special">&lt;=</span> <span class="number">0</span><span class="special">)</span> <span class="special">?</span> <span class="number">1</span> <span class="special">:</span> <span class="identifier">n</span> <span class="special">*</span> <span class="special">(*</span><span class="keyword">this</span><span class="special">)(</span><span class="identifier">n</span><span class="special">-</span><span class="number">1</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-</pre>
-<p>
-        (See factorial.cpp)
-      </p>
-<p>
-        Having implemented the <code class="computeroutput"><span class="identifier">factorial_impl</span></code>
-        type, we can declare and instantiate a lazy <code class="computeroutput"><span class="identifier">factorial</span></code>
-        function this way:
-      </p>
-<pre class="programlisting"><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">factorial_impl</span><span class="special">&gt;</span> <span class="identifier">factorial</span><span class="special">;</span>
-</pre>
-<p>
-        Invoking a lazy function such as <code class="computeroutput"><span class="identifier">factorial</span></code>
-        does not immediately execute the function object <code class="computeroutput"><span class="identifier">factorial_impl</span></code>.
-        Instead, an <a class="link" href="../actor.html" title="Actor">actor</a> object is created
-        and returned to the caller. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-</pre>
-<p>
-        does nothing more than return an actor. A second function call will invoke
-        the actual factorial function. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)(</span><span class="number">4</span><span class="special">);</span>
-</pre>
-<p>
-        will print out "24".
-      </p>
-<p>
-        Take note that in certain cases (e.g. for function objects with state), an
-        instance of the model of <a href="http://www.boost.org/doc/libs/release/libs/fusion/doc/html/fusion/functional/concepts/poly.html" target="_top">Polymorphic
-        Function Object</a> may be passed on to the constructor. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">factorial_impl</span><span class="special">&gt;</span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">ftor</span><span class="special">);</span>
-</pre>
-<p>
-        where ftor is an instance of factorial_impl (this is not necessary in this
-        case as <code class="computeroutput"><span class="identifier">factorial_impl</span></code> does
-        not require any state).
-      </p>
-<div class="important"><table border="0" summary="Important">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../../doc/src/images/important.png"></td>
-<th align="left">Important</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Take care though when using function objects with state because they are
-          often copied repeatedly, and state may change in one of the copies, rather
-          than the original.
-        </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="core/nothing.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="function/adapting_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/function/adapting_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,370 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Adapting Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../function.html" title="Function">
-<link rel="prev" href="../function.html" title="Function">
-<link rel="next" href="../operator.html" title="Operator">
-</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="../function.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../function.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../operator.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.function.adapting_functions"></a><a class="link" href="adapting_functions.html" title="Adapting Functions">Adapting
-        Functions</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span></dt>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_FUNCTION</span></dt>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span></dt>
-<dt><span class="section">BOOST_PHOENIX_ADAPT_CALLABLE</span></dt>
-</dl></div>
-<p>
-          If you want to adapt already existing functions or function objects it
-          will become a repetetive task. Therefor the following boilerplate macros
-          are provided to help you adapt already exsiting functions, thus reducing
-          the need to <a class="link" href="../bind.html" title="Bind">phoenix.modules.bind</a>
-          functions.
-        </p>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary" title="BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary nullary function a lazy function.
-          </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-              These macros generate no global objects. The resulting lazy functions
-              are real functions that create the lazy function expression object
-            </p></td></tr>
-</table></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span><span class="special">(</span>
-    <span class="identifier">RETURN_TYPE</span>
-  <span class="special">,</span> <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to have a nullary lazy function
-            <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which calls
-            the nullary <code class="computeroutput"><span class="identifier">FUNCTION</span></code>
-            that has the return type <code class="computeroutput"><span class="identifier">RETURN_TYPE</span></code>
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function_nullary.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">foo</span><span class="special">()</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="number">42</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION_NULLARY</span><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">foo</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">foo</span><span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">placeholders</span><span class="special">::</span><span class="identifier">_1</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">((</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">foo</span><span class="special">())(</span><span class="number">1</span><span class="special">)</span> <span class="special">==</span> <span class="number">43</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function" title="BOOST_PHOENIX_ADAPT_FUNCTION">BOOST_PHOENIX_ADAPT_FUNCTION</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary function a lazy function.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span><span class="special">(</span>
-    <span class="identifier">RETURN_TYPE</span>
-  <span class="special">,</span> <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION_ARITY</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to have a lazy function
-            <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which calls
-            <code class="computeroutput"><span class="identifier">FUNCTION</span></code> that has the
-            return type <code class="computeroutput"><span class="identifier">RETURN_TYPE</span></code>
-            with <code class="computeroutput"><span class="identifier">FUNCTION_ARITY</span></code> number
-            of arguments.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_function.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">plus</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">int</span> <span class="identifier">b</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span><span class="special">;</span>
-    <span class="special">}</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-    <span class="identifier">T</span>
-    <span class="identifier">plus</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">c</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="identifier">c</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">plus</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_FUNCTION</span><span class="special">(</span>
-    <span class="keyword">typename</span> <span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;::</span><span class="identifier">type</span>
-  <span class="special">,</span> <span class="identifier">plus</span>
-  <span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span>
-  <span class="special">,</span> <span class="number">3</span>
-<span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg1</span><span class="special">;</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg2</span><span class="special">;</span>
-
-    <span class="keyword">int</span> <span class="identifier">a</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
-    <span class="keyword">int</span> <span class="identifier">b</span> <span class="special">=</span> <span class="number">256</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">);</span>
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">,</span> <span class="number">3</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">3</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary" title="BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary nullary function object a lazy function.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span><span class="special">(</span>
-    <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">CALLABLE</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to create <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which creates a lazy
-            function object that represents a nullary call to <code class="computeroutput"><span class="identifier">CALLABLE</span></code>.
-            The return type is specified by <code class="computeroutput"><span class="identifier">CALLABLE</span></code>
-            conforming to the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> protocol.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_callable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable_nullary.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">foo</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">int</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-        <span class="identifier">result_type</span> <span class="keyword">operator</span><span class="special">()()</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="number">42</span><span class="special">;</span>
-        <span class="special">}</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE_NULLARY</span><span class="special">(</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">foo</span><span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">placeholders</span><span class="special">::</span><span class="identifier">_1</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">((</span><span class="identifier">_1</span> <span class="special">+</span> <span class="identifier">foo</span><span class="special">())(</span><span class="number">1</span><span class="special">)</span> <span class="special">==</span> <span class="number">43</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable"></a><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable" title="BOOST_PHOENIX_ADAPT_CALLABLE">BOOST_PHOENIX_ADAPT_CALLABLE</a>
-</h5></div></div></div>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h0"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.description"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span></code>
-            is a macro that can be used to generate all the necessary boilerplate
-            to make an arbitrary function object a lazy function.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h1"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.synopsis"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.synopsis">Synopsis</a>
-          </h6>
-<pre class="programlisting"><span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span><span class="special">(</span>
-    <span class="identifier">LAZY_FUNCTION</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION_NAME</span>
-  <span class="special">,</span> <span class="identifier">FUNCTION_ARITY</span>
-<span class="special">)</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h2"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.semantics"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.semantics">Semantics</a>
-          </h6>
-<p>
-            The above macro generates all necessary code to create <code class="computeroutput"><span class="identifier">LAZY_FUNCTION</span></code> which creates a lazy
-            function object that represents a call to <code class="computeroutput"><span class="identifier">CALLABLE</span></code>
-            with <code class="computeroutput"><span class="identifier">FUNCTION_ARITY</span></code> arguments.
-            The return type is specified by <code class="computeroutput"><span class="identifier">CALLABLE</span></code>
-            conforming to the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> protocol.
-          </p>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h3"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.header"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.header">Header</a>
-          </h6>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">adapt_callable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<h6>
-<a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.h4"></a>
-            <span><a name="phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.example"></a></span><a class="link" href="adapting_functions.html#phoenix.modules.function.adapting_functions.boost_phoenix_adapt_callable.example">Example</a>
-          </h6>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">demo</span>
-<span class="special">{</span>
-    <span class="keyword">struct</span> <span class="identifier">plus</span>
-    <span class="special">{</span>
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Sig</span><span class="special">&gt;</span>
-        <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-        <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span><span class="special">)&gt;</span>
-            <span class="special">:</span> <span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span>
-        <span class="special">{};</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">This</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A2</span><span class="special">&gt;</span>
-        <span class="keyword">struct</span> <span class="identifier">result</span><span class="special">&lt;</span><span class="identifier">This</span><span class="special">(</span><span class="identifier">A0</span><span class="special">,</span> <span class="identifier">A1</span><span class="special">,</span> <span class="identifier">A2</span><span class="special">)&gt;</span>
-            <span class="special">:</span> <span class="identifier">remove_reference</span><span class="special">&lt;</span><span class="identifier">A0</span><span class="special">&gt;</span>
-        <span class="special">{};</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">&gt;</span>
-        <span class="identifier">A0</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="identifier">a0</span> <span class="special">+</span> <span class="identifier">a1</span><span class="special">;</span>
-        <span class="special">}</span>
-
-        <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">A0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">A2</span><span class="special">&gt;</span>
-        <span class="identifier">A0</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">A0</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a0</span><span class="special">,</span> <span class="identifier">A1</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a1</span><span class="special">,</span> <span class="identifier">A2</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="identifier">a2</span><span class="special">)</span> <span class="keyword">const</span>
-        <span class="special">{</span>
-            <span class="keyword">return</span> <span class="identifier">a0</span> <span class="special">+</span> <span class="identifier">a1</span> <span class="special">+</span> <span class="identifier">a2</span><span class="special">;</span>
-        <span class="special">}</span>
-    <span class="special">};</span>
-<span class="special">}</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span><span class="special">(</span><span class="identifier">plus</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span>
-
-<span class="identifier">BOOST_PHOENIX_ADAPT_CALLABLE</span><span class="special">(</span><span class="identifier">plus</span><span class="special">,</span> <span class="identifier">demo</span><span class="special">::</span><span class="identifier">plus</span><span class="special">,</span> <span class="number">3</span><span class="special">)</span>
-
-<span class="keyword">int</span> <span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg1</span><span class="special">;</span>
-    <span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">arg_names</span><span class="special">::</span><span class="identifier">arg2</span><span class="special">;</span>
-
-    <span class="keyword">int</span> <span class="identifier">a</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
-    <span class="keyword">int</span> <span class="identifier">b</span> <span class="special">=</span> <span class="number">256</span><span class="special">;</span>
-
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">);</span>
-    <span class="identifier">assert</span><span class="special">(</span><span class="identifier">plus</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">,</span> <span class="number">3</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">3</span><span class="special">);</span>
-<span class="special">}</span>
-</pre>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../function.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../function.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../operator.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,55 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Object</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="statement/throw_.html" title="throw_">
-<link rel="next" href="object/construction.html" title="Construction">
-</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="statement/throw_.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="object/construction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.object"></a><a class="link" href="object.html" title="Object">Object</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Construction</span></dt>
-<dt><span class="section">New</span></dt>
-<dt><span class="section">Delete</span></dt>
-<dt><span class="section">Casts</span></dt>
-</dl></div>
-<p>
-        The Object module deals with object construction, destruction and conversion.
-        The module provides <span class="emphasis"><em>"lazy"</em></span> versions of C++'s
-        object constructor, <code class="computeroutput"><span class="keyword">new</span></code>, <code class="computeroutput"><span class="keyword">delete</span></code>, <code class="computeroutput"><span class="keyword">static_cast</span></code>,
-        <code class="computeroutput"><span class="keyword">dynamic_cast</span></code>, <code class="computeroutput"><span class="keyword">const_cast</span></code> and <code class="computeroutput"><span class="keyword">reinterpret_cast</span></code>.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="statement/throw_.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="object/construction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/casts.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,71 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Casts</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="delete.html" title="Delete">
-<link rel="next" href="../scope.html" title="Scope">
-</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="delete.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../scope.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.casts"></a><a class="link" href="casts.html" title="Casts">Casts</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy casts...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">static_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">dynamic_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">const_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">reinterpret_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The set of lazy C++ cast template functions provide a way of lazily casting
-          an object of a certain type to another type. The syntax resembles the well
-          known C++ casts. Take note however that the lazy versions have a trailing
-          underscore.
-        </p>
-<pre class="programlisting"><span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-<span class="identifier">dynamic_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-<span class="identifier">const_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-<span class="identifier">reinterpret_cast_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
-</pre>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="identifier">Base</span><span class="special">*&gt;(&amp;</span><span class="identifier">arg1</span><span class="special">)</span>
-</pre>
-<p>
-          Static-casts the address of <code class="computeroutput"><span class="identifier">arg1</span></code>
-          to a <code class="computeroutput"><span class="identifier">Base</span><span class="special">*</span></code>.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="delete.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../scope.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/construction.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Construction</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="../object.html" title="Object">
-<link rel="next" href="new.html" title="New">
-</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="../object.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.construction"></a><a class="link" href="construction.html" title="Construction">Construction</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy constructors...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="identifier">construct</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Lazily construct an object from an arbitrary set of arguments:
-        </p>
-<pre class="programlisting"><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
-</pre>
-<p>
-          where the given parameters are the parameters to the constructor of the
-          object of type T (This implies, that type T is expected to have a constructor
-          with a corresponding set of parameter types.).
-        </p>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
-</pre>
-<p>
-          Constructs a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> from <code class="computeroutput"><span class="identifier">arg1</span></code>
-          and <code class="computeroutput"><span class="identifier">arg2</span></code>.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            The maximum number of actual parameters is limited by the preprocessor
-            constant BOOST_PHOENIX_COMPOSITE_LIMIT. Note though, that this limit
-            should not be greater than BOOST_PHOENIX_LIMIT. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_COMPOSITE_LIMIT</span></code> is set
-            to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-            (See <a class="link" href="../../actor.html" title="Actor">Actor</a>).
-          </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../object.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/delete.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,61 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Delete</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="new.html" title="New">
-<link rel="next" href="casts.html" title="Casts">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="new.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="casts.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.delete"></a><a class="link" href="delete.html" title="Delete">Delete</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy delete...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">delete</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Lazily delete an object, from the heap:
-        </p>
-<pre class="programlisting"><span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg</span><span class="special">);</span>
-</pre>
-<p>
-          where arg is assumed to be a pointer to an object.
-        </p>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">delete_</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// note the spelling of delete_ (with trailing underscore)</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="new.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="casts.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/object/new.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>New</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../object.html" title="Object">
-<link rel="prev" href="construction.html" title="Construction">
-<link rel="next" href="delete.html" title="Delete">
-</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="construction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="delete.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.object.new"></a><a class="link" href="new.html" title="New">New</a>
-</h4></div></div></div>
-<p>
-          <span class="bold"><strong><span class="emphasis"><em>Lazy new...</em></span></strong></span>
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">new</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          Lazily construct an object, on the heap, from an arbitrary set of arguments:
-        </p>
-<pre class="programlisting"><span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
-</pre>
-<p>
-          where the given parameters are the parameters to the contractor of the
-          object of type T (This implies, that type T is expected to have a constructor
-          with a corresponding set of parameter types.).
-        </p>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// note the spelling of new_ (with trailing underscore)</span>
-</pre>
-<p>
-          Creates a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> from <code class="computeroutput"><span class="identifier">arg1</span></code>
-          and <code class="computeroutput"><span class="identifier">arg2</span></code> on the heap.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            The maximum number of actual parameters is limited by the preprocessor
-            constant BOOST_PHOENIX_COMPOSITE_LIMIT. Note though, that this limit
-            should not be greater than BOOST_PHOENIX_LIMIT. By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_COMPOSITE_LIMIT</span></code> is set
-            to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>
-            (See <a class="link" href="../../actor.html" title="Actor">Actor</a>).
-          </p></td></tr>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="construction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../object.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="delete.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/operator.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,368 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Operator</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="function/adapting_functions.html" title="Adapting Functions">
-<link rel="next" href="statement.html" title="Statement">
-</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="function/adapting_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.operator"></a><a class="link" href="operator.html" title="Operator">Operator</a>
-</h3></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-        This facility provides a mechanism for lazily evaluating operators. Syntactically,
-        a lazy operator looks and feels like an ordinary C/C++ infix, prefix or postfix
-        operator. The operator application looks the same. However, unlike ordinary
-        operators, the actual operator execution is deferred. Samples:
-      </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span>
-<span class="number">1</span> <span class="special">+</span> <span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg2</span>
-<span class="number">1</span> <span class="special">/</span> <span class="special">-</span><span class="identifier">arg1</span>
-<span class="identifier">arg1</span> <span class="special">&lt;</span> <span class="number">150</span>
-</pre>
-<p>
-        We have seen the lazy operators in action (see <a class="link" href="../starter_kit/lazy_operators.html" title="Lazy Operators">Quick
-        Start - Lazy Operators</a>). Let's go back and examine them a little bit
-        further:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-</pre>
-<p>
-        Through operator overloading, the expression <code class="computeroutput"><span class="identifier">arg1</span>
-        <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> actually
-        generates an actor. This actor object is passed on to STL's <code class="computeroutput"><span class="identifier">find_if</span></code> function. From the viewpoint of
-        STL, the expression is simply a function object expecting a single argument
-        of the containers value_type. For each element in <code class="computeroutput"><span class="identifier">c</span></code>,
-        the element is passed on as an argument <code class="computeroutput"><span class="identifier">arg1</span></code>
-        to the actor (function object). The actor checks if this is an odd value
-        based on the expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span>
-        <span class="number">1</span></code> where arg1 is replaced by the container's
-        element.
-      </p>
-<p>
-        Like lazy functions (see <a class="link" href="function.html" title="Function">Function</a>),
-        lazy operators are not immediately executed when invoked. Instead, an actor
-        (see <a class="link" href="../actor.html" title="Actor">Actor</a>) object is created and returned
-        to the caller. Example:
-      </p>
-<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span>
-</pre>
-<p>
-        does nothing more than return an actor. A second function call will evaluate
-        the actual operators. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">((</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span><span class="special">)(</span><span class="number">4</span><span class="special">,</span> <span class="number">5</span><span class="special">,</span> <span class="number">6</span><span class="special">);</span>
-</pre>
-<p>
-        will print out "54".
-      </p>
-<p>
-        Operator expressions are lazily evaluated following four simple rules:
-      </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-            A binary operator, except <code class="computeroutput"><span class="special">-&gt;*</span></code>
-            will be lazily evaluated when <span class="emphasis"><em>at least</em></span> one of its
-            operands is an actor object (see <a class="link" href="../actor.html" title="Actor">Actor</a>).
-          </li>
-<li class="listitem">
-            Unary operators are lazily evaluated if their argument is an actor object.
-          </li>
-<li class="listitem">
-            Operator <code class="computeroutput"><span class="special">-&gt;*</span></code> is lazily
-            evaluated if the left hand argument is an actor object.
-          </li>
-<li class="listitem">
-            The result of a lazy operator is an actor object that can in turn allow
-            the applications of rules 1, 2 and 3.
-          </li>
-</ol></div>
-<p>
-        For example, to check the following expression is lazily evaluated:
-      </p>
-<pre class="programlisting"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span>
-</pre>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-            Following rule 1, <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></code> is
-            lazily evaluated since <code class="computeroutput"><span class="identifier">arg1</span></code>
-            is an actor (see <a class="link" href="core/arguments.html" title="Arguments">Arguments</a>).
-          </li>
-<li class="listitem">
-            The result of this <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></code> expression
-            is an actor object, following rule 4.
-          </li>
-<li class="listitem">
-            Continuing, <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
-            <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is again lazily evaluated. Rule 2.
-          </li>
-<li class="listitem">
-            By rule 4 again, the result of <code class="computeroutput"><span class="identifier">arg1</span>
-            <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is
-            an actor object.
-          </li>
-<li class="listitem">
-            As <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
-            <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is an actor, <code class="computeroutput"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span></code> is lazily evaluated. Rule 2.
-          </li>
-</ol></div>
-<p>
-        Lazy-operator application is highly contagious. In most cases, a single
-        <code class="computeroutput"><span class="identifier">argN</span></code> actor infects all its
-        immediate neighbors within a group (first level or parenthesized expression).
-      </p>
-<p>
-        Note that at least one operand of any operator must be a valid actor for
-        lazy evaluation to take effect. To force lazy evaluation of an ordinary expression,
-        we can use <code class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> or <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-        to transform an operand into a valid actor object (see <a class="link" href="core.html" title="Core">Core</a>).
-        For example:
-      </p>
-<pre class="programlisting"><span class="number">1</span> <span class="special">&lt;&lt;</span> <span class="number">3</span><span class="special">;</span>      <span class="comment">// Immediately evaluated</span>
-<span class="identifier">val</span><span class="special">(</span><span class="number">1</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="number">3</span><span class="special">;</span> <span class="comment">// Lazily evaluated</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h0"></a>
-        <span><a name="phoenix.modules.operator.supported_operators"></a></span><a class="link" href="operator.html#phoenix.modules.operator.supported_operators">Supported
-        operators</a>
-      </h5>
-<h5>
-<a name="phoenix.modules.operator.h1"></a>
-        <span><a name="phoenix.modules.operator.unary_operators"></a></span><a class="link" href="operator.html#phoenix.modules.operator.unary_operators">Unary
-        operators</a>
-      </h5>
-<pre class="programlisting"><span class="identifier">prefix</span><span class="special">:</span>   <span class="special">~,</span> <span class="special">!,</span> <span class="special">-,</span> <span class="special">+,</span> <span class="special">++,</span> <span class="special">--,</span> <span class="special">&amp;</span> <span class="special">(</span><span class="identifier">reference</span><span class="special">),</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">dereference</span><span class="special">)</span>
-<span class="identifier">postfix</span><span class="special">:</span>  <span class="special">++,</span> <span class="special">--</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h2"></a>
-        <span><a name="phoenix.modules.operator.binary_operators"></a></span><a class="link" href="operator.html#phoenix.modules.operator.binary_operators">Binary
-        operators</a>
-      </h5>
-<pre class="programlisting"><span class="special">=,</span> <span class="special">[],</span> <span class="special">+=,</span> <span class="special">-=,</span> <span class="special">*=,</span> <span class="special">/=,</span> <span class="special">%=,</span> <span class="special">&amp;=,</span> <span class="special">|=,</span> <span class="special">^=,</span> <span class="special">&lt;&lt;=,</span> <span class="special">&gt;&gt;=</span>
-<span class="special">+,</span> <span class="special">-,</span> <span class="special">*,</span> <span class="special">/,</span> <span class="special">%,</span> <span class="special">&amp;,</span> <span class="special">|,</span> <span class="special">^,</span> <span class="special">&lt;&lt;,</span> <span class="special">&gt;&gt;</span>
-<span class="special">==,</span> <span class="special">!=,</span> <span class="special">&lt;,</span> <span class="special">&gt;,</span> <span class="special">&lt;=,</span> <span class="special">&gt;=</span>
-<span class="special">&amp;&amp;,</span> <span class="special">||,</span> <span class="special">-&gt;*</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h3"></a>
-        <span><a name="phoenix.modules.operator.ternary_operator"></a></span><a class="link" href="operator.html#phoenix.modules.operator.ternary_operator">Ternary
-        operator</a>
-      </h5>
-<pre class="programlisting"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span>
-</pre>
-<p>
-        The ternary operator deserves special mention. Since C++ does not allow us
-        to overload the conditional expression: <code class="computeroutput"><span class="identifier">c</span>
-        <span class="special">?</span> <span class="identifier">a</span> <span class="special">:</span> <span class="identifier">b</span></code>, the
-        if_else pseudo function is provided for this purpose. The behavior is identical,
-        albeit in a lazy manner.
-      </p>
-<h5>
-<a name="phoenix.modules.operator.h4"></a>
-        <span><a name="phoenix.modules.operator.member_pointer_operator"></a></span><a class="link" href="operator.html#phoenix.modules.operator.member_pointer_operator">Member
-        pointer operator</a>
-      </h5>
-<pre class="programlisting"><span class="identifier">a</span><span class="special">-&gt;*</span><span class="identifier">member_object_pointer</span>
-<span class="identifier">a</span><span class="special">-&gt;*</span><span class="identifier">member_function_pointer</span>
-</pre>
-<p>
-        The left hand side of the member pointer operator must be an actor returning
-        a pointer type. The right hand side of the member pointer operator may be
-        either a pointer to member object or pointer to member function.
-      </p>
-<p>
-        If the right hand side is a member object pointer, the result is an actor
-        which, when evaluated, returns a reference to that member. For example:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">A</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">member</span><span class="special">;</span>
-<span class="special">};</span>
-
-<span class="identifier">A</span><span class="special">*</span> <span class="identifier">a</span> <span class="special">=</span> <span class="keyword">new</span> <span class="identifier">A</span><span class="special">;</span>
-<span class="special">...</span>
-
-<span class="special">(</span><span class="identifier">arg1</span><span class="special">-&gt;*&amp;</span><span class="identifier">A</span><span class="special">::</span><span class="identifier">member</span><span class="special">)(</span><span class="identifier">a</span><span class="special">);</span> <span class="comment">// returns member a-&gt;member</span>
-</pre>
-<p>
-        If the right hand side is a member function pointer, the result is an actor
-        which, when invoked, calls the specified member function. For example:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">A</span>
-<span class="special">{</span>
-    <span class="keyword">int</span> <span class="identifier">func</span><span class="special">(</span><span class="keyword">int</span><span class="special">);</span>
-<span class="special">};</span>
-
-<span class="identifier">A</span><span class="special">*</span> <span class="identifier">a</span> <span class="special">=</span> <span class="keyword">new</span> <span class="identifier">A</span><span class="special">;</span>
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
-
-<span class="special">(</span><span class="identifier">arg1</span><span class="special">-&gt;*&amp;</span><span class="identifier">A</span><span class="special">::</span><span class="identifier">func</span><span class="special">)(</span><span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">i</span><span class="special">);</span> <span class="comment">// returns a-&gt;func(i)</span>
-</pre>
-<h5>
-<a name="phoenix.modules.operator.h5"></a>
-        <span><a name="phoenix.modules.operator.include_files"></a></span><a class="link" href="operator.html#phoenix.modules.operator.include_files">Include
-        Files</a>
-      </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Operators
-                </p>
-              </th>
-<th>
-                <p>
-                  File
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">-</span></code>, <code class="computeroutput"><span class="special">+</span></code>,
-                  <code class="computeroutput"><span class="special">++</span></code>, <code class="computeroutput"><span class="special">--</span></code>, <code class="computeroutput"><span class="special">+=</span></code>,
-                  <code class="computeroutput"><span class="special">-=</span></code>, <code class="computeroutput"><span class="special">*=</span></code>, <code class="computeroutput"><span class="special">/=</span></code>,
-                  <code class="computeroutput"><span class="special">%=</span></code>, <code class="computeroutput"><span class="special">*</span></code>, <code class="computeroutput"><span class="special">/</span></code>,
-                  <code class="computeroutput"><span class="special">%</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">arithmetic</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">&amp;=</span></code>, <code class="computeroutput"><span class="special">|=</span></code>, <code class="computeroutput"><span class="special">^=</span></code>,
-                  <code class="computeroutput"><span class="special">&lt;&lt;=</span></code>, <code class="computeroutput"><span class="special">&gt;&gt;=</span></code>, <code class="computeroutput"><span class="special">&amp;</span></code>,
-                  <code class="computeroutput"><span class="special">|</span></code>, <code class="computeroutput"><span class="special">^</span></code>,
-                  <code class="computeroutput"><span class="special">&lt;&lt;</span></code>, <code class="computeroutput"><span class="special">&gt;&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">bitwise</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">==</span></code>, <code class="computeroutput"><span class="special">!=</span></code>, <code class="computeroutput"><span class="special">&lt;</span></code>,
-                  <code class="computeroutput"><span class="special">&lt;=</span></code>, <code class="computeroutput"><span class="special">&gt;</span></code>, <code class="computeroutput"><span class="special">&gt;=</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">comparison</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">&lt;&lt;</span></code>, <code class="computeroutput"><span class="special">&gt;&gt;</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">io</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">!</span></code>, &amp;&amp;, <code class="computeroutput"><span class="special">||</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">logical</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">&amp;</span><span class="identifier">x</span></code>,
-                  <code class="computeroutput"><span class="special">*</span><span class="identifier">p</span></code>,
-                  <code class="computeroutput"><span class="special">=</span></code>, <code class="computeroutput"><span class="special">[]</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">self</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                  <span class="identifier">a</span><span class="special">,</span>
-                  <span class="identifier">b</span><span class="special">)</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">if_else</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="special">-&gt;*</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">member</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="function/adapting_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,66 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Scope</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="object/casts.html" title="Casts">
-<link rel="next" href="scope/local_variables.html" title="Local Variables">
-</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="object/casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="scope/local_variables.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.scope"></a><a class="link" href="scope.html" title="Scope">Scope</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Local Variables</span></dt>
-<dt><span class="section">let</span></dt>
-<dt><span class="section">lambda</span></dt>
-</dl></div>
-<p>
-        Up until now, the most basic ingredient is missing: creation of and access
-        to local variables in the stack. When recursion comes into play, you will
-        soon realize the need to have true local variables. It may seem that we do
-        not need this at all since an unnamed lambda function cannot call itself
-        anyway; at least not directly. With some sort of arrangement, situations
-        will arise where a lambda function becomes recursive. A typical situation
-        occurs when we store a lambda function in a Boost.Function,
-        essentially naming the unnamed lambda.
-      </p>
-<p>
-        There will also be situations where a lambda function gets passed as an argument
-        to another function. This is a more common situation. In this case, the lambda
-        function assumes a new scope; new arguments and possibly new local variables.
-      </p>
-<p>
-        This section deals with local variables and nested lambda scopes.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="object/casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="scope/local_variables.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/lambda.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,194 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>lambda</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../scope.html" title="Scope">
-<link rel="prev" href="let.html" title="let">
-<link rel="next" href="../bind.html" title="Bind">
-</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="let.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.scope.lambda"></a><a class="link" href="lambda.html" title="lambda">lambda</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">lambda</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          A lot of times, you'd want to write a lazy function that accepts one or
-          more functions (higher order functions). STL algorithms come to mind, for
-          example. Consider a lazy version of <code class="computeroutput"><span class="identifier">stl</span><span class="special">::</span><span class="identifier">for_each</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">for_each_impl</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">F</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">void</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">F</span><span class="special">&gt;</span>
-    <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">C</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">F</span> <span class="identifier">f</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">f</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">for_each_impl</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">for_each</span> <span class="special">=</span> <span class="identifier">for_each_impl</span><span class="special">();</span>
-</pre>
-<p>
-          Notice that the function accepts another function, <code class="computeroutput"><span class="identifier">f</span></code>
-          as an argument. The scope of this function, <code class="computeroutput"><span class="identifier">f</span></code>,
-          is limited within the <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>. When <code class="computeroutput"><span class="identifier">f</span></code>
-          is called inside <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>, it exists in a new scope, along
-          with new arguments and, possibly, local variables. This new scope is not
-          at all related to the outer scopes beyond the <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>.
-        </p>
-<p>
-          Simple syntax:
-        </p>
-<pre class="programlisting"><span class="identifier">lambda</span>
-<span class="special">[</span>
-    <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">body</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Like <code class="computeroutput"><span class="identifier">let</span></code>, local variables
-          may be declared, allowing 1..N local variable declarations (where N ==
-          <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>):
-        </p>
-<pre class="programlisting"><span class="identifier">lambda</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">body</span>
-<span class="special">]</span>
-</pre>
-<p>
-          The same restrictions apply with regard to scope and visibility. The RHS
-          (right hand side lambda-expression) of each local-declaration cannot refer
-          to any LHS local-id. The local-ids are not in scope yet; they will be in
-          scope only in the lambda-body:
-        </p>
-<pre class="programlisting"><span class="identifier">lambda</span><span class="special">(</span>
-    <span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
-  <span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Error: _a is not in scope yet</span>
-<span class="special">)</span>
-</pre>
-<p>
-          See <a class="link" href="let.html#phoenix.modules.scope.let.visibility"><code class="computeroutput"><span class="identifier">let</span></code> Visibility</a> for more information.
-        </p>
-<p>
-          Example: Using our lazy <code class="computeroutput"><span class="identifier">for_each</span></code>
-          let's print all the elements in a container:
-        </p>
-<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">lambda</span><span class="special">[</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">])</span>
-</pre>
-<p>
-          As far as the arguments are concerned (arg1..argN), the scope in which
-          the lambda-body exists is totally new. The left <code class="computeroutput"><span class="identifier">arg1</span></code>
-          refers to the argument passed to <code class="computeroutput"><span class="identifier">for_each</span></code>
-          (a container). The right <code class="computeroutput"><span class="identifier">arg1</span></code>
-          refers to the argument passed by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>
-          when we finally get to call <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code> in our <code class="computeroutput"><span class="identifier">for_each_impl</span></code>
-          above (a container element).
-        </p>
-<p>
-          Yet, we may wish to get information from outer scopes. While we do not
-          have access to arguments in outer scopes, what we still have is access
-          to local variables from outer scopes. We may only be able to pass argument
-          related information from outer <code class="computeroutput"><span class="identifier">lambda</span></code>
-          scopes through the local variables.
-        </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            This is a crucial difference between <code class="computeroutput"><span class="identifier">let</span></code>
-            and <code class="computeroutput"><span class="identifier">lambda</span></code>: <code class="computeroutput"><span class="identifier">let</span></code> does not introduce new arguments;
-            <code class="computeroutput"><span class="identifier">lambda</span></code> does.
-          </p></td></tr>
-</table></div>
-<p>
-          Another example: Using our lazy <code class="computeroutput"><span class="identifier">for_each</span></code>,
-          and a lazy <code class="computeroutput"><span class="identifier">push_back</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">push_back_impl</span>
-<span class="special">{</span>
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-    <span class="keyword">struct</span> <span class="identifier">result</span>
-    <span class="special">{</span>
-        <span class="keyword">typedef</span> <span class="keyword">void</span> <span class="identifier">type</span><span class="special">;</span>
-    <span class="special">};</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
-    <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">C</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="identifier">c</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">x</span><span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">push_back_impl</span><span class="special">&gt;</span> <span class="keyword">const</span> <span class="identifier">push_back</span> <span class="special">=</span> <span class="identifier">push_back_impl</span><span class="special">();</span>
-</pre>
-<p>
-          write a lambda expression that accepts:
-        </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-              a 2-dimensional container (e.g. <code class="computeroutput"><span class="identifier">vector</span><span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="special">&gt;</span></code>)
-            </li>
-<li class="listitem">
-              a container element (e.g. <code class="computeroutput"><span class="keyword">int</span></code>)
-            </li>
-</ol></div>
-<p>
-          and pushes-back the element to each of the <code class="computeroutput"><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span></code>.
-        </p>
-<p>
-          Solution:
-        </p>
-<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
-    <span class="identifier">lambda</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg2</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_a</span><span class="special">)</span>
-    <span class="special">]</span>
-<span class="special">)</span>
-</pre>
-<p>
-          Since we do not have access to the arguments of the outer scopes beyond
-          the lambda-body, we introduce a local variable <code class="computeroutput"><span class="identifier">_a</span></code>
-          that captures the second outer argument: <code class="computeroutput"><span class="identifier">arg2</span></code>.
-          Hence: _a = arg2. This local variable is visible inside the lambda scope.
-        </p>
-<p>
-          (See lambda.cpp)
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="let.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bind.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/let.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,182 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>let</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../scope.html" title="Scope">
-<link rel="prev" href="local_variables.html" title="Local Variables">
-<link rel="next" href="lambda.html" title="lambda">
-</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="local_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lambda.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.scope.let"></a><a class="link" href="let.html" title="let">let</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">let</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          You declare local variables using the syntax:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">let</span><span class="special">-</span><span class="identifier">body</span>
-<span class="special">]</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">let</span></code> allows 1..N local variable
-          declarations (where N == <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>).
-          Each declaration follows the form:
-        </p>
-<pre class="programlisting"><span class="identifier">local</span><span class="special">-</span><span class="identifier">id</span> <span class="special">=</span> <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">expression</span>
-</pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-            You can set <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>,
-            the predefined maximum local variable declarations in a let expression.
-            By default, <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LOCAL_LIMIT</span></code>
-            is set to <code class="computeroutput"><span class="identifier">BOOST_PHOENIX_LIMIT</span></code>.
-          </p></td></tr>
-</table></div>
-<p>
-          Example:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">123</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">_a</span> <span class="special">+</span> <span class="identifier">_b</span>
-<span class="special">]</span>
-</pre>
-<p>
-          <span class="bold"><strong>Reference Preservation</strong></span>
-        </p>
-<p>
-          The type of the local variable assumes the type of the lambda- expression.
-          Type deduction is reference preserving. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
-</pre>
-<p>
-          <code class="computeroutput"><span class="identifier">_a</span></code> assumes the type of
-          <code class="computeroutput"><span class="identifier">arg1</span></code>: a reference to an
-          argument, while <code class="computeroutput"><span class="identifier">_b</span></code> has
-          type <code class="computeroutput"><span class="keyword">int</span></code>.
-        </p>
-<p>
-          Consider this:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
-
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">--</span><span class="identifier">_a</span> <span class="special">&lt;&lt;</span> <span class="char">' '</span>
-<span class="special">]</span>
-<span class="special">(</span><span class="identifier">i</span><span class="special">);</span>
-
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>
-</pre>
-<p>
-          the output of above is : 0 0
-        </p>
-<p>
-          While with this:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
-
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">val</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">))</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="special">--</span><span class="identifier">_a</span> <span class="special">&lt;&lt;</span> <span class="char">' '</span>
-<span class="special">]</span>
-<span class="special">(</span><span class="identifier">i</span><span class="special">);</span>
-
-<span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>
-</pre>
-<p>
-          the output is : 0 1
-        </p>
-<p>
-          Reference preservation is necessary because we need to have L-value access
-          to outer lambda-scopes (especially the arguments). <code class="computeroutput"><span class="identifier">arg</span></code>s
-          and <code class="computeroutput"><span class="identifier">ref</span></code>s are L-values.
-          <code class="computeroutput"><span class="identifier">val</span></code>s are R-values.
-        </p>
-<p>
-          <span class="bold"><strong>Visibility</strong></span> <a name="phoenix.modules.scope.let.visibility"></a>
-        </p>
-<p>
-          The scope and lifetimes of the local variables is limited within the let-body.
-          <code class="computeroutput"><span class="identifier">let</span></code> blocks can be nested.
-          A local variable may hide an outer local variable. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_x</span> <span class="special">=</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">_y</span> <span class="special">=</span> <span class="string">", World"</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="comment">// _x here is an int: 1</span>
-
-    <span class="identifier">let</span><span class="special">(</span><span class="identifier">_x</span> <span class="special">=</span> <span class="string">"Hello"</span><span class="special">)</span> <span class="comment">// hides the outer _x</span>
-    <span class="special">[</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">_x</span> <span class="special">&lt;&lt;</span> <span class="identifier">_y</span> <span class="comment">// prints "Hello, World"</span>
-    <span class="special">]</span>
-<span class="special">]</span>
-</pre>
-<p>
-          The RHS (right hand side lambda-expression) of each local-declaration cannot
-          refer to any LHS local-id. At this point, the local-ids are not in scope
-          yet; they will only be in scope in the let-body. The code below is in error:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span>
-    <span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
-  <span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Error: _a is not in scope yet</span>
-<span class="special">)</span>
-<span class="special">[</span>
-    <span class="comment">// _a and _b's scope starts here</span>
-    <span class="comment">/*. body .*/</span>
-<span class="special">]</span>
-</pre>
-<p>
-          However, if an outer let scope is available, this will be searched. Since
-          the scope of the RHS of a local-declaration is the outer scope enclosing
-          the let, the RHS of a local-declaration can refer to a local variable of
-          an outer scope:
-        </p>
-<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">let</span><span class="special">(</span>
-        <span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
-      <span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Ok. _a refers to the outer _a</span>
-    <span class="special">)</span>
-    <span class="special">[</span>
-        <span class="comment">/*. body .*/</span>
-    <span class="special">]</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="local_variables.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lambda.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/scope/local_variables.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,69 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Local Variables</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../scope.html" title="Scope">
-<link rel="prev" href="../scope.html" title="Scope">
-<link rel="next" href="let.html" title="let">
-</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="../scope.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="let.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.scope.local_variables"></a><a class="link" href="local_variables.html" title="Local Variables">Local Variables</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">local_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          We use an instance of:
-        </p>
-<pre class="programlisting"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;::</span><span class="identifier">type</span>
-</pre>
-<p>
-          to represent a local variable. The local variable acts as an imaginary
-          data-bin where a local, stack based data will be placed. <code class="computeroutput"><span class="identifier">Key</span></code> is an arbitrary type that is used
-          to identify the local variable. Example:
-        </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">size_key</span><span class="special">;</span>
-<span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">size_key</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">size</span><span class="special">;</span>
-</pre>
-<p>
-          <span class="bold"><strong>Predefined Local Variables</strong></span>
-        </p>
-<p>
-          There are a few predefined instances of <code class="computeroutput"><span class="identifier">expression</span><span class="special">::</span><span class="identifier">local_variable</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          named <code class="computeroutput"><span class="identifier">_a</span></code>..<code class="computeroutput"><span class="identifier">_z</span></code> that you can already use. To make
-          use of them, simply use the <code class="computeroutput"><span class="keyword">namespace</span>
-          <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span></code>:
-        </p>
-<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span><span class="special">;</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../scope.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../scope.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="let.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,114 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Statement</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="operator.html" title="Operator">
-<link rel="next" href="statement/block_statement.html" title="Block Statement">
-</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="operator.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement/block_statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.statement"></a><a class="link" href="statement.html" title="Statement">Statement</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Block Statement</span></dt>
-<dt><span class="section">if_ Statement</span></dt>
-<dt><span class="section">if_else_ Statement</span></dt>
-<dt><span class="section"><a href="statement/switch__statement.html">switch_
-        Statement</a></span></dt>
-<dt><span class="section"><a href="statement/while__statement.html">while_
-        Statement</a></span></dt>
-<dt><span class="section">do_while_ Statement</span></dt>
-<dt><span class="section">for_ Statement</span></dt>
-<dt><span class="section"><a href="statement/try__catch__statement.html">try_
-        catch_ Statement</a></span></dt>
-<dt><span class="section">throw_</span></dt>
-</dl></div>
-<p>
-        <span class="bold"><strong><span class="emphasis"><em>Lazy statements...</em></span></strong></span>
-      </p>
-<p>
-        The expressions presented so far are sufficiently powerful to construct quite
-        elaborate structures. We have presented lazy-functions and lazy-operators.
-        How about lazy-statements? First, an appetizer:
-      </p>
-<p>
-        Print all odd-numbered contents of an STL container using <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>
-        (all_odds.cpp):
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="char">' '</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</pre>
-<p>
-        Huh? Is that valid C++? Read on...
-      </p>
-<p>
-        Yes, it is valid C++. The sample code above is as close as you can get to
-        the syntax of C++. This stylized C++ syntax differs from actual C++ code.
-        First, the <code class="computeroutput"><span class="keyword">if</span></code> has a trailing
-        underscore. Second, the block uses square brackets instead of the familiar
-        curly braces {}.
-      </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top">
-<p>
-          <span class="bold"><strong>C++ in C++?</strong></span>
-        </p>
-<p>
-          In as much as Spirit
-          attempts to mimic EBNF in C++, Phoenix attempts to mimic C++ in C++!!!
-        </p>
-</td></tr>
-</table></div>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Unlike lazy functions and lazy operators, lazy statements always return
-          void.
-        </p></td></tr>
-</table></div>
-<p>
-        Here are more examples with annotations. The code almost speaks for itself.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="operator.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="statement/block_statement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___do_while_____statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,73 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>do_while_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="while__statement.html" title="while_ Statement">
-<link rel="next" href="for_statement.html" title="for_ Statement">
-</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="while__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.___do_while_____statement"></a><a class="link" href="___do_while_____statement.html" title="do_while_ Statement">do_while_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">do_while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">do_</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-</pre>
-<p>
-          Again, take note that <code class="computeroutput"><span class="keyword">while</span></code>
-          has a leading dot and a trailing underscore: <code class="computeroutput"><span class="special">.</span><span class="identifier">while_</span></code>
-        </p>
-<p>
-          Example: This code is almost the same as the previous example above with
-          a slight twist in logic.
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">do_</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-        <span class="special">]</span>
-        <span class="special">.</span><span class="identifier">while_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">--),</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"\n"</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="while__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/___if_else_____statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,88 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>if_else_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="if__statement.html" title="if_ Statement">
-<link rel="next" href="switch__statement.html" title="switch_ Statement">
-</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="if__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="switch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.___if_else_____statement"></a><a class="link" href="___if_else_____statement.html" title="if_else_ Statement">if_else_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is
-        </p>
-<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">else_</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Take note that <code class="computeroutput"><span class="keyword">else</span></code> has a
-          leading dot and a trailing underscore: <code class="computeroutput"><span class="special">.</span><span class="identifier">else_</span></code>
-        </p>
-<p>
-          Example: This code prints out all the elements and appends <code class="computeroutput"><span class="string">" &gt; 5"</span></code>, <code class="computeroutput"><span class="string">"
-          == 5"</span></code> or <code class="computeroutput"><span class="string">" &lt; 5"</span></code>
-          depending on the element's actual value:
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">&gt;</span> <span class="number">5</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">" &gt; 5\n"</span>
-    <span class="special">]</span>
-    <span class="special">.</span><span class="identifier">else_</span>
-    <span class="special">[</span>
-        <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">==</span> <span class="number">5</span><span class="special">)</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">" == 5\n"</span>
-        <span class="special">]</span>
-        <span class="special">.</span><span class="identifier">else_</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">" &lt; 5\n"</span>
-        <span class="special">]</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</pre>
-<p>
-          Notice how the <code class="computeroutput"><span class="identifier">if_else_</span></code>
-          statement is nested.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="if__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="switch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/block_statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,91 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Block Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="../statement.html" title="Statement">
-<link rel="next" href="if__statement.html" title="if_ Statement">
-</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="../statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="if__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.block_statement"></a><a class="link" href="block_statement.html" title="Block Statement">Block Statement</a>
-</h4></div></div></div>
-<p>
-          Syntax:
-        </p>
-<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span>
-<span class="special">....</span>
-<span class="identifier">statement</span>
-</pre>
-<p>
-          Basically, these are comma separated statements. Take note that unlike
-          the C/C++ semicolon, the comma is a separator put <span class="bold"><strong>in-between</strong></span>
-          statements. This is like Pascal's semicolon separator, rather than C/C++'s
-          semicolon terminator. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span> <span class="comment">// ERROR!</span>
-</pre>
-<p>
-          Is an error. The last statement should not have a comma. Block statements
-          can be grouped using the parentheses. Again, the last statement in a group
-          should not have a trailing comma.
-        </p>
-<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
-<span class="identifier">statement</span><span class="special">,</span>
-<span class="special">(</span>
-    <span class="identifier">statement</span><span class="special">,</span>
-    <span class="identifier">statement</span>
-<span class="special">),</span>
-<span class="identifier">statement</span>
-</pre>
-<p>
-          Outside the square brackets, block statements should be grouped. For example:
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">do_this</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">),</span>
-        <span class="identifier">do_that</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</pre>
-<p>
-          Wrapping a comma operator chain around a parentheses pair blocks the interpretation
-          as an argument separator. The reason for the exception for the square bracket
-          operator is that the operator always takes exactly one argument, so it
-          "transforms" any attempt at multiple arguments with a comma operator
-          chain (and spits out an error for zero arguments).
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="if__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/for_statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,81 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>for_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="___do_while_____statement.html" title="do_while_ Statement">
-<link rel="next" href="try__catch__statement.html" title="try_ catch_ Statement">
-</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="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="try__catch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.for_statement"></a><a class="link" href="for_statement.html" title="for_ Statement">for_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">for</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">for_</span><span class="special">(</span><span class="identifier">init_statement</span><span class="special">,</span> <span class="identifier">conditional_expression</span><span class="special">,</span> <span class="identifier">step_statement</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</pre>
-<p>
-          It is again very similar to the C++ for statement. Take note that the init_statement,
-          conditional_expression and step_statement are separated by the comma instead of the semi-colon
-          and each must be present (i.e. <code class="computeroutput"><span class="identifier">for_</span><span class="special">(,,)</span></code> is invalid). This is a case where the
-          <a class="link" href="../core/nothing.html" title="Nothing"><code class="computeroutput"><span class="identifier">nothing</span></code></a>
-          actor can be useful.
-        </p>
-<p>
-          Example: This code prints each element N times where N is the element's
-          value. A newline terminates the printout of each value.
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">iii</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">for_</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">)</span> <span class="special">&lt;</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="special">++</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">))</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-        <span class="special">],</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"\n"</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</pre>
-<p>
-          As before, all these are lazily evaluated. The result of such statements
-          are in fact expressions that are passed on to STL's for_each function.
-          In the viewpoint of <code class="computeroutput"><span class="identifier">for_each</span></code>,
-          what was passed is just a functor, no more, no less.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="try__catch__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/if__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>if_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="block_statement.html" title="Block Statement">
-<link rel="next" href="___if_else_____statement.html" title="if_else_ Statement">
-</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="block_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.if__statement"></a><a class="link" href="if__statement.html" title="if_ Statement">if_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          We have seen the <code class="computeroutput"><span class="identifier">if_</span></code> statement.
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="block_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/switch__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,74 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>switch_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="___if_else_____statement.html" title="if_else_ Statement">
-<link rel="next" href="while__statement.html" title="while_ Statement">
-</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="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="while__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.switch__statement"></a><a class="link" href="switch__statement.html" title="switch_ Statement">switch_
-        Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">switch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">switch_</span><span class="special">(</span><span class="identifier">integral_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">case_</span><span class="special">&lt;</span><span class="identifier">integral_value</span><span class="special">&gt;(</span><span class="identifier">sequenced_statements</span><span class="special">),</span>
-    <span class="special">...</span>
-    <span class="identifier">default_</span><span class="special">&lt;</span><span class="identifier">integral_value</span><span class="special">&gt;(</span><span class="identifier">sequenced_statements</span><span class="special">)</span>
-<span class="special">]</span>
-</pre>
-<p>
-          A comma separated list of cases, and an optional default can be provided.
-          Note unlike a normal switch statement, cases do not fall through.
-        </p>
-<p>
-          Example: This code prints out <code class="computeroutput"><span class="string">"one"</span></code>,
-          <code class="computeroutput"><span class="string">"two"</span></code> or <code class="computeroutput"><span class="string">"other value"</span></code> depending on the
-          element's actual value:
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">switch_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">case_</span><span class="special">&lt;</span><span class="number">1</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"one"</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="char">'\n'</span><span class="special">),</span>
-        <span class="identifier">case_</span><span class="special">&lt;</span><span class="number">2</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"two"</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="char">'\n'</span><span class="special">),</span>
-        <span class="identifier">default_</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"other value"</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="char">'\n'</span><span class="special">)</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="___if_else_____statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="while__statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/throw_.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,84 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>throw_</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="try__catch__statement.html" title="try_ catch_ Statement">
-<link rel="next" href="../object.html" title="Object">
-</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="try__catch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../object.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.throw_"></a><a class="link" href="throw_.html" title="throw_">throw_</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">throw</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          As a natural companion to the try/catch support, the statement module provides
-          lazy throwing and re-throwing of exceptions.
-        </p>
-<p>
-          The syntax to throw an exception is:
-        </p>
-<pre class="programlisting"><span class="identifier">throw_</span><span class="special">(</span><span class="identifier">exception_expression</span><span class="special">)</span>
-</pre>
-<p>
-          The syntax to re-throw an exception is:
-        </p>
-<pre class="programlisting"><span class="identifier">throw_</span><span class="special">()</span>
-</pre>
-<p>
-          Example: This code extends the try/catch example, re-throwing exceptions
-          derived from runtime_error or exception, and translating other exception
-          types to runtime_errors.
-        </p>
-<pre class="programlisting"><span class="identifier">try_</span>
-<span class="special">[</span>
-    <span class="identifier">f</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">runtime_error</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught runtime error or derived\n"</span><span class="special">),</span>
-    <span class="identifier">throw_</span><span class="special">()</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">exception</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught exception or derived\n"</span><span class="special">),</span>
-    <span class="identifier">throw_</span><span class="special">()</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_all</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught some other type of exception\n"</span><span class="special">),</span>
-    <span class="identifier">throw_</span><span class="special">(</span><span class="identifier">runtime_error</span><span class="special">(</span><span class="string">"translated exception"</span><span class="special">))</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="try__catch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../object.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/try__catch__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,89 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>try_ catch_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="for_statement.html" title="for_ Statement">
-<link rel="next" href="throw_.html" title="throw_">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="throw_.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.try__catch__statement"></a><a class="link" href="try__catch__statement.html" title="try_ catch_ Statement">try_
-        catch_ Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">try_catch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">try_</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">exception_type</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-<span class="special">...</span>
-<span class="special">.</span><span class="identifier">catch_all</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statement</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Note the usual underscore after try and catch, and the extra parentheses
-          required after the catch.
-        </p>
-<p>
-          Example: The following code calls the (lazy) function <code class="computeroutput"><span class="identifier">f</span></code>
-          for each element, and prints messages about different exception types it
-          catches.
-        </p>
-<pre class="programlisting"><span class="identifier">try_</span>
-<span class="special">[</span>
-    <span class="identifier">f</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">runtime_error</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught runtime error or derived\n"</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_</span><span class="special">&lt;</span><span class="identifier">exception</span><span class="special">&gt;()</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught exception or derived\n"</span><span class="special">)</span>
-<span class="special">]</span>
-<span class="special">.</span><span class="identifier">catch_all</span>
-<span class="special">[</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"caught some other type of exception\n"</span><span class="special">)</span>
-<span class="special">]</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="for_statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="throw_.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/statement/while__statement.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,69 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>while_ Statement</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../statement.html" title="Statement">
-<link rel="prev" href="switch__statement.html" title="switch_ Statement">
-<link rel="next" href="___do_while_____statement.html" title="do_while_ Statement">
-</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="switch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.statement.while__statement"></a><a class="link" href="while__statement.html" title="while_ Statement">while_
-        Statement</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The syntax is:
-        </p>
-<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">sequenced_statements</span>
-<span class="special">]</span>
-</pre>
-<p>
-          Example: This code decrements each element until it reaches zero and prints
-          out the number at each step. A newline terminates the printout of each
-          value.
-        </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="special">(</span>
-        <span class="identifier">while_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">--)</span>
-        <span class="special">[</span>
-            <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-        <span class="special">],</span>
-        <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"\n"</span><span class="special">)</span>
-    <span class="special">)</span>
-<span class="special">);</span>
-</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 &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="switch__statement.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../statement.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="___do_while_____statement.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>STL</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../modules.html" title="Modules">
-<link rel="prev" href="bind/compatibility_with_boost_bind.html" title="Compatibility with Boost.Bind">
-<link rel="next" href="stl/container.html" title="Container">
-</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="bind/compatibility_with_boost_bind.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stl/container.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.modules.stl"></a><a class="link" href="stl.html" title="STL">STL</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Container</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-</dl></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-        This section summarizes the lazy equivalents of C++ Standard Library functionality
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="bind/compatibility_with_boost_bind.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../modules.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stl/container.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/algorithm.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,1141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Algorithm</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../stl.html" title="STL">
-<link rel="prev" href="container.html" title="Container">
-<link rel="next" href="../../inside.html" title="Inside Phoenix">
-</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="container.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../inside.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.stl.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The algorithm module provides wrappers for the standard algorithms in the
-          <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span></code> and <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">numeric</span><span class="special">&gt;</span></code>
-          headers.
-        </p>
-<p>
-          The algorithms are divided into the categories iteration, transformation
-          and querying, modeling the Boost.MPL
-          library. The different algorithm classes can be included using the headers:
-        </p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">iteration</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transformation</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">querying</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The functions of the algorithm module take ranges as arguments where appropriate.
-          This is different to the standard library, but easy enough to pick up.
-          Ranges are described in detail in the Boost.Range
-          library.
-        </p>
-<p>
-          For example, using the standard copy algorithm to copy between 2 arrays:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
-<span class="keyword">int</span> <span class="identifier">output</span><span class="special">[</span><span class="number">3</span><span class="special">];</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">array</span><span class="special">,</span> <span class="identifier">array</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">output</span><span class="special">);</span> <span class="comment">// We have to provide iterators</span>
-                                     <span class="comment">// to both the start and end of array</span>
-</pre>
-<p>
-          The analogous code using the phoenix algorithm module is:
-        </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
-<span class="keyword">int</span> <span class="identifier">output</span><span class="special">[</span><span class="number">3</span><span class="special">];</span>
-<span class="identifier">copy</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">array</span><span class="special">,</span> <span class="identifier">output</span><span class="special">);</span> <span class="comment">// Notice only 2 arguments, the end of</span>
-                                 <span class="comment">// array is established automatically</span>
-</pre>
-<p>
-          The Boost.Range
-          library provides support for standard containers, strings and arrays, and
-          can be extended to support additional types.
-        </p>
-<p>
-          The following tables describe the different categories of algorithms, and
-          their semantics.
-        </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-          <span class="inlinemediaobject"><img src="../../../images/tip.png" alt="tip"></span> Arguments in brackets denote optional parameters.
-        </p>
-</div>
-<div class="table">
-<a name="phoenix.modules.stl.algorithm.t0"></a><p class="title"><b>Table&#160;1.6.&#160;Iteration Algorithms</b></p>
-<div class="table-contents"><table class="table" summary="Iteration Algorithms">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    stl Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="table">
-<a name="phoenix.modules.stl.algorithm.t1"></a><p class="title"><b>Table&#160;1.7.&#160;Querying Algorithms</b></p>
-<div class="table-contents"><table class="table" summary="Querying Algorithms">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    stl Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">i</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="table">
-<a name="phoenix.modules.stl.algorithm.t2"></a><p class="title"><b>Table&#160;1.8.&#160;Transformation Algorithms</b></p>
-<div class="table-contents"><table class="table" summary="Transformation Algorithms">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    stl Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">i</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">,</span>
-                    <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">,</span>
-                    <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">m</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">m</span><span class="special">,</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">m</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">m</span><span class="special">,</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">n</span><span class="special">,</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span>
-                    <span class="identifier">r2</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
-                    <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span>
-                    <span class="identifier">o</span><span class="special">[,</span>
-                    <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break">
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="container.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../inside.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/modules/stl/container.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,601 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Container</title>
-<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../stl.html" title="STL">
-<link rel="prev" href="../stl.html" title="STL">
-<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="../stl.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.modules.stl.container"></a><a class="link" href="container.html" title="Container">Container</a>
-</h4></div></div></div>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-</pre>
-<p>
-          The container module predefines a set of lazy functions that work on STL
-          containers. These functions provide a mechanism for the lazy evaluation
-          of the public member functions of the STL containers. The lazy functions
-          are thin wrappers that simply forward to their respective counterparts
-          in the STL library.
-        </p>
-<p>
-          Lazy functions are provided for all of the member functions of the following
-          containers:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-              deque
-            </li>
-<li class="listitem">
-              list
-            </li>
-<li class="listitem">
-              map
-            </li>
-<li class="listitem">
-              multimap
-            </li>
-<li class="listitem">
-              vector
-            </li>
-</ul></div>
-<p>
-          Indeed, should your class have member functions with the same names and
-          signatures as those listed below, then it will automatically be supported.
-          To summarize, lazy functions are provided for member functions:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-              assign
-            </li>
-<li class="listitem">
-              at
-            </li>
-<li class="listitem">
-              back
-            </li>
-<li class="listitem">
-              begin
-            </li>
-<li class="listitem">
-              capacity
-            </li>
-<li class="listitem">
-              clear
-            </li>
-<li class="listitem">
-              empty
-            </li>
-<li class="listitem">
-              end
-            </li>
-<li class="listitem">
-              erase
-            </li>
-<li class="listitem">
-              front
-            </li>
-<li class="listitem">
-              get_allocator
-            </li>
-<li class="listitem">
-              insert
-            </li>
-<li class="listitem">
-              key_comp
-            </li>
-<li class="listitem">
-              max_size
-            </li>
-<li class="listitem">
-              pop_back
-            </li>
-<li class="listitem">
-              pop_front
-            </li>
-<li class="listitem">
-              push_back
-            </li>
-<li class="listitem">
-              push_front
-            </li>
-<li class="listitem">
-              rbegin
-            </li>
-<li class="listitem">
-              rend
-            </li>
-<li class="listitem">
-              reserve
-            </li>
-<li class="listitem">
-              resize
-            </li>
-<li class="listitem">
-              size
-            </li>
-<li class="listitem">
-              splice
-            </li>
-<li class="listitem">
-              value_comp
-            </li>
-</ul></div>
-<p>
-          The lazy functions' names are the same as the corresponding member function.
-          The difference is that the lazy functions are free functions and therefore
-          does not use the member "dot" syntax.
-        </p>
-<div class="table">
-<a name="phoenix.modules.stl.container.t0"></a><p class="title"><b>Table&#160;1.4.&#160;Sample usage</b></p>
-<div class="table-contents"><table class="table" summary="Sample usage">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    "Normal" version
-                  </p>
-                </th>
-<th>
-                  <p>
-                    "Lazy" version
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="number">5</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
-                    <span class="number">5</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">my_list</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">my_vector1</span><span class="special">.</span><span class="identifier">swap</span><span class="special">(</span><span class="identifier">my_vector2</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">swap</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
-                    <span class="identifier">arg2</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><p>
-          Notice that member functions with names that clash with stl algorithms
-          are absent. This will be provided in Phoenix's algorithm module.
-        </p>
-<p>
-          No support is provided here for lazy versions of <code class="computeroutput"><span class="keyword">operator</span><span class="special">+=</span></code>, <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> etc. Such operators are not specific
-          to STL containers and lazy versions can therefore be found in <a class="link" href="../operator.html" title="Operator">operators</a>.
-        </p>
-<p>
-          The following table describes the container functions and their semantics.
-        </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-          <span class="inlinemediaobject"><img src="../../../images/tip.png" alt="tip"></span> Arguments in brackets denote optional parameters.
-        </p>
-</div>
-<div class="table">
-<a name="phoenix.modules.stl.container.t1"></a><p class="title"><b>Table&#160;1.5.&#160;Lazy STL Container Functions</b></p>
-<div class="table-contents"><table class="table" summary="Lazy STL Container Functions">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Function
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Semantics
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">assign</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">i</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">back</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">capacity</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">clear</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">clear</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">erase</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">front</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">get_allocator</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">get_allocator</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">insert</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">key_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">key_comp</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">max_size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">max_size</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_back</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rend</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">n</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">resize</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">resize</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">splice</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">])</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span>
-                    <span class="identifier">b</span><span class="special">,</span>
-                    <span class="identifier">c</span><span class="special">,</span>
-                    <span class="identifier">d</span><span class="special">])</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">value_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">value_comp</span><span class="special">()</span></code>
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break">
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../stl.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stl.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/organization.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/organization.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,361 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Organization</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="basics.html" title="Basics">
-<link rel="next" href="actor.html" title="Actor">
-</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="basics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.organization"></a><a class="link" href="organization.html" title="Organization">Organization</a>
-</h2></div></div></div>
-<p>
-      Care and attention to detail was given, painstakingly, to the design and implementation
-      of Phoenix.
-    </p>
-<p>
-      The library is organized in four layers:
-    </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Actor
-        </li>
-<li class="listitem">
-          Value, Reference, Arguments
-        </li>
-<li class="listitem">
-          Function, Operator, Object, Statement, Scope
-        </li>
-<li class="listitem">
-          STL, Fusion, Bind
-        </li>
-</ol></div>
-<p>
-      The modules are orthogonal, with no cyclic dependencies. Lower layers do not
-      depend on higher layers. Modules in a layer do not depend on other modules
-      in the same layer. This means, for example, that Bind can be completely discarded
-      if it is not required; or one could perhaps take out Operator and Statement
-      and just use Function, which may be desirable in a pure FP application.
-    </p>
-<p>
-      The library has grown from the original Phoenix but still comprises only header
-      files. There are no object files to link against.
-    </p>
-<h3>
-<a name="phoenix.organization.h0"></a>
-      <span><a name="phoenix.organization.core"></a></span><a class="link" href="organization.html#phoenix.organization.core">Core</a>
-    </h3>
-<p>
-      The lowest two layers comprise the core.
-    </p>
-<p>
-      The <a class="link" href="actor.html" title="Actor"><code class="computeroutput"><span class="identifier">Actor</span></code></a>
-      is the main concept behind the library. Lazy functions are abstracted as actors.
-    </p>
-<p>
-      Terminals provide the basic building blocks of functionality within Phoenix.
-      Expressions are used to combine these terminals together to provide more powerful
-      functionality.
-    </p>
-<p>
-      Expressions are composed of zero or more actors. Each actor in a composite
-      can again be another expression.
-    </p>
-<div class="table">
-<a name="phoenix.organization.t0"></a><p class="title"><b>Table&#160;1.2.&#160;Modules</b></p>
-<div class="table-contents"><table class="table" summary="Modules">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-              <p>
-                Module
-              </p>
-            </th>
-<th>
-              <p>
-                Description
-              </p>
-            </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-              <p>
-                Function
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy functions support (e.g. <code class="computeroutput"><span class="identifier">add</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Operator
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy operators support (e.g. <code class="computeroutput"><span class="special">+</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Statement
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy statements (e.g. <code class="computeroutput"><span class="identifier">if_</span></code>,
-                <code class="computeroutput"><span class="identifier">while_</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Object
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy casts (e.g. <code class="computeroutput"><span class="identifier">static_cast_</span></code>),
-                object creation destruction (e.g. <code class="computeroutput"><span class="identifier">new_</span></code>,
-                <code class="computeroutput"><span class="identifier">delete_</span></code>)
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Scope
-              </p>
-            </td>
-<td>
-              <p>
-                Support for scopes, local variables and lambda-lambda
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Bind
-              </p>
-            </td>
-<td>
-              <p>
-                Lazy functions from free functions, member functions or member variables.
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                STL Container
-              </p>
-            </td>
-<td>
-              <p>
-                Set of predefined "lazy" functions that work on STL containers
-                and sequences (e.g. <code class="computeroutput"><span class="identifier">push_back</span></code>).
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                STL Algorithm
-              </p>
-            </td>
-<td>
-              <p>
-                Set of predefined "lazy" versions of the STL algorithms
-                (e.g. <code class="computeroutput"><span class="identifier">find_if</span></code>).
-              </p>
-            </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><p>
-      Each module is defined in a header file with the same name. For example, the
-      core module is defined in <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>.
-    </p>
-<div class="table">
-<a name="phoenix.organization.t1"></a><p class="title"><b>Table&#160;1.3.&#160;Includes</b></p>
-<div class="table-contents"><table class="table" summary="Includes">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-              <p>
-                Module
-              </p>
-            </th>
-<th>
-              <p>
-                File
-              </p>
-            </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-              <p>
-                Core
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Function
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Operator
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Statement
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Object
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Scope
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Bind
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Container
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                Algorithm
-              </p>
-            </td>
-<td>
-              <p>
-                <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<br class="table-break"><div class="sidebar">
-<div class="titlepage"></div>
-<p>
-      <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Finer grained include files are available per feature;
-      see the succeeding sections.
-    </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="basics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="actor.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/references.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,90 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="acknowledgments.html" title="Acknowledgments">
-</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="acknowledgments.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.references"></a><a class="link" href="references.html" title="References">References</a>
-</h2></div></div></div>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Why Functional Programming Matters, John Hughes, 1989. Available online
-          at http://www.math.chalmers.se/~rjmh/Papers/whyfp.html.
-        </li>
-<li class="listitem">
-          Boost.Lambda library, Jaakko Jarvi, 1999-2004 Jaakko Jarvi, Gary Powell.
-          Available online at http://www.boost.org/libs/lambda/.
-        </li>
-<li class="listitem">
-          Functional Programming in C++ using the FC++ Library: a short article introducing
-          FC++, Brian McNamara and Yannis Smaragdakis, August 2003. Available online
-          at http://www.cc.gatech.edu/~yannis/fc++/.
-        </li>
-<li class="listitem">
-          Side-effects and partial function application in C++, Jaakko Jarvi and
-          Gary Powell, 2001. Available online at http://osl.iu.edu/~jajarvi/publications/papers/mpool01.pdf.
-        </li>
-<li class="listitem">
-          Spirit Version 1.8.1, Joel de Guzman, Nov 2004. Available online at http://www.boost.org/libs/spirit/.
-        </li>
-<li class="listitem">
-          The Boost MPL Library, Aleksey Gurtovoy and David Abrahams, 2002-2004.
-          Available online at http://www.boost.org/libs/mpl/.
-        </li>
-<li class="listitem">
-          Generic Programming Redesign of Patterns, Proceedings of the 5th European
-          Conference on Pattern Languages of Programs, (EuroPLoP'2000) Irsee, Germany,
-          July 2000. Available online at http://www.coldewey.com/europlop2000/papers/geraud%2Bduret.zip.
-        </li>
-<li class="listitem">
-          A Gentle Introduction to Haskell, Paul Hudak, John Peterson and Joseph
-          Fasel, 1999. Available online at http://www.haskell.org/tutorial/.
-        </li>
-<li class="listitem">
-          Large scale software design, John Lackos, ISBN 0201633620, Addison-Wesley,
-          July 1996.
-        </li>
-<li class="listitem">
-          Design Patterns, Elements of Reusable Object-Oriented Software, Erich Gamma,
-          Richard Helm, Ralph Jhonson, and John Vlissides, Addison-Wesley, 1995.
-        </li>
-<li class="listitem">
-          The Forwarding Problem: Arguments Peter Dimov, Howard E. Hinnant, Dave
-          Abrahams, September 09, 2002. Available online: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
-          Function Problem</a>.
-        </li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="acknowledgments.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Starter Kit</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="introduction.html" title="Introduction">
-<link rel="next" href="starter_kit/values.html" title="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="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit/values.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.starter_kit"></a><a class="link" href="starter_kit.html" title="Starter Kit">Starter Kit</a>
-</h2></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Values</span></dt>
-<dt><span class="section">References</span></dt>
-<dt><span class="section">Arguments</span></dt>
-<dt><span class="section">Lazy Operators</span></dt>
-<dt><span class="section">Lazy Statements</span></dt>
-<dt><span class="section"><a href="starter_kit/construct__new__delete__casts.html">Construct,
-      New, Delete, Casts</a></span></dt>
-<dt><span class="section">Lazy Functions</span></dt>
-<dt><span class="section">More</span></dt>
-</dl></div>
-<p>
-      Most "quick starts" only get you a few blocks from where you are.
-      From there, you are on your own. Yet, typically, you'd want to get to the next
-      city. This starter kit shall be as minimal as possible, yet packed as much
-      power as possible.
-    </p>
-<p>
-      So you are busy and always on the go. You do not wish to spend a lot of time
-      studying the library. You wish to be spared the details for later when you
-      need it. For now, all you need to do is to get up to speed as quickly as possible
-      and start using the library. If this is the case, this is the right place to
-      start.
-    </p>
-<p>
-      This section is by no means a thorough discourse of the library. For more information
-      on Phoenix, please take some time to read the rest of the Documentation. Yet,
-      if you just want to use the library quickly, now, this chapter will probably
-      suffice. Rather than taking you to the details of the library, we shall try
-      to provide you with annotated examples instead. Hopefully, this will get you
-      into high gear quickly.
-    </p>
-<h4>
-<a name="phoenix.starter_kit.h0"></a>
-      <span><a name="phoenix.starter_kit.functors_everywhere"></a></span><a class="link" href="starter_kit.html#phoenix.starter_kit.functors_everywhere">Functors
-      everywhere</a>
-    </h4>
-<p>
-      Phoenix is built on function objects (functors). The functor is the main building
-      block. We compose functors to build more complex functors... to build more
-      complex functors... and so on. Almost everything is a functor.
-    </p>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-        Functors are so ubiquitous in Phoenix that, in the manual, the words <span class="emphasis"><em>"functor"</em></span>
-        and <span class="emphasis"><em>"function"</em></span> are used interchangeably.
-      </p></td></tr>
-</table></div>
-<p>
-      We start with some core functions that are called <span class="bold"><strong>primitives</strong></span>.
-      You can think of primitives (such as values, references and arguments) as atoms.
-    </p>
-<p>
-      Things start to get interesting when we start <span class="emphasis"><em>composing</em></span>
-      primitives to form <span class="bold"><strong>expressions</strong></span>. The expressions
-      can, in turn, be composed to form even more complex expressions.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit/values.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/arguments.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,75 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Arguments</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="references.html" title="References">
-<link rel="next" href="lazy_operators.html" title="Lazy Operators">
-</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="references.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_operators.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.arguments"></a><a class="link" href="arguments.html" title="Arguments">Arguments</a>
-</h3></div></div></div>
-<p>
-        Arguments are also functions? You bet!
-      </p>
-<p>
-        Until now, we have been dealing with expressions returning a nullary function.
-        Arguments, on the other hand, evaluate to an N-ary function. An argument
-        represents the Nth argument. There are a few predefined arguments arg1, arg2,
-        arg3, arg4 and so on (and it's BLL
-        counterparts: _1, _2, _3, _4 and so on). Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="comment">// one-or-more argument function that returns its first argument</span>
-<span class="identifier">arg2</span> <span class="comment">// two-or-more argument function that returns its second argument</span>
-<span class="identifier">arg3</span> <span class="comment">// three-or-more argument function that returns its third argument</span>
-</pre>
-<p>
-        <code class="computeroutput"><span class="identifier">argN</span></code> returns the Nth argument.
-        Examples:
-      </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>        <span class="comment">// prints 3</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg2</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>     <span class="comment">// prints "Hello World"</span>
-</pre>
-<p>
-        (See arguments.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about arguments <a class="link" href="../modules/core/arguments.html" title="Arguments">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="references.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_operators.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/construct__new__delete__casts.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,70 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Construct, New, Delete, Casts</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="lazy_statements.html" title="Lazy Statements">
-<link rel="next" href="lazy_functions.html" title="Lazy Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_statements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.construct__new__delete__casts"></a><a class="link" href="construct__new__delete__casts.html" title="Construct, New, Delete, Casts">Construct,
-      New, Delete, Casts</a>
-</h3></div></div></div>
-<p>
-        You'll probably want to work with objects. There are lazy versions of constructor
-        calls, <code class="computeroutput"><span class="keyword">new</span></code>, <code class="computeroutput"><span class="keyword">delete</span></code>
-        and the suite of C++ casts. Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">construct</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>  <span class="comment">// constructs a std::string from arg1, arg2</span>
-<span class="identifier">new_</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>       <span class="comment">// makes a new std::string from arg1, arg2</span>
-<span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>                       <span class="comment">// deletes arg1 (assumed to be a pointer)</span>
-<span class="identifier">static_cast_</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">*&gt;(</span><span class="identifier">arg1</span><span class="special">)</span>            <span class="comment">// static_cast's arg1 to an int*</span>
-</pre>
-<div class="note"><table border="0" summary="Note">
-<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
-<th align="left">Note</th>
-</tr>
-<tr><td align="left" valign="top"><p>
-          Take note that, by convention, names that conflict with C++ reserved words
-          are appended with a single trailing underscore <code class="computeroutput"><span class="char">'_'</span></code>
-        </p></td></tr>
-</table></div>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about this <a class="link" href="../modules/object.html" title="Object">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_statements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_functions.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,109 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Lazy Functions</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="construct__new__delete__casts.html" title="Construct, New, Delete, Casts">
-<link rel="next" href="more.html" title="More">
-</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="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="more.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_functions"></a><a class="link" href="lazy_functions.html" title="Lazy Functions">Lazy Functions</a>
-</h3></div></div></div>
-<p>
-        As you write more lambda functions, you'll notice certain patterns that you
-        wish to refactor as reusable functions. When you reach that point, you'll
-        wish that ordinary functions can co-exist with phoenix functions. Unfortunately,
-        the <span class="emphasis"><em>immediate</em></span> nature of plain C++ functions make them
-        incompatible.
-      </p>
-<p>
-        Lazy functions are your friends. The library provides a facility to make
-        lazy functions. The code below is a rewrite of the <code class="computeroutput"><span class="identifier">is_odd</span></code>
-        function using the facility:
-      </p>
-<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">is_odd_impl</span>
-<span class="special">{</span>
-    <span class="keyword">typedef</span> <span class="keyword">bool</span> <span class="identifier">result_type</span><span class="special">;</span>
-
-    <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">()(</span><span class="identifier">Arg</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="keyword">const</span>
-    <span class="special">{</span>
-        <span class="keyword">return</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span>
-    <span class="special">}</span>
-<span class="special">};</span>
-
-<span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">is_odd_impl</span><span class="special">&gt;</span> <span class="identifier">is_odd</span><span class="special">;</span>
-</pre>
-<h5>
-<a name="phoenix.starter_kit.lazy_functions.h0"></a>
-        <span><a name="phoenix.starter_kit.lazy_functions.things_to_note_"></a></span><a class="link" href="lazy_functions.html#phoenix.starter_kit.lazy_functions.things_to_note_">Things
-        to note:</a>
-      </h5>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            Result type deduction is implemented with the help of the result_of protocol.
-            For more information see <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a>
-          </li>
-<li class="listitem">
-            <code class="computeroutput"><span class="identifier">is_odd_impl</span></code> implements
-            the function.
-          </li>
-<li class="listitem">
-            <code class="computeroutput"><span class="identifier">is_odd</span></code>, an instance of
-            <code class="computeroutput"><span class="identifier">function</span><span class="special">&lt;</span><span class="identifier">is_odd_impl</span><span class="special">&gt;</span></code>,
-            is the lazy function.
-          </li>
-</ul></div>
-<p>
-        Now, <code class="computeroutput"><span class="identifier">is_odd</span></code> is a truly lazy
-        function that we can use in conjunction with the rest of phoenix. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">is_odd</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">));</span>
-</pre>
-<p>
-        (See function.cpp)
-      </p>
-<h5>
-<a name="phoenix.starter_kit.lazy_functions.h1"></a>
-        <span><a name="phoenix.starter_kit.lazy_functions.predefined_lazy_functions"></a></span><a class="link" href="lazy_functions.html#phoenix.starter_kit.lazy_functions.predefined_lazy_functions">Predefined
-        Lazy Functions</a>
-      </h5>
-<p>
-        The library is chock full of STL savvy, predefined lazy functions covering
-        the whole of the STL containers, iterators and algorithms. For example, there
-        are lazy versions of container related operations such as assign, at, back,
-        begin, pop_back, pop_front, push_back, push_front, etc. (See <a class="link" href="../modules/stl.html" title="STL">STL</a>).
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="more.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_operators.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,149 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Lazy Operators</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="arguments.html" title="Arguments">
-<link rel="next" href="lazy_statements.html" title="Lazy Statements">
-</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="arguments.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_statements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_operators"></a><a class="link" href="lazy_operators.html" title="Lazy Operators">Lazy Operators</a>
-</h3></div></div></div>
-<p>
-        You can use the usual set of operators to form expressions. Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg1</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span>
-<span class="identifier">arg1</span> <span class="special">=</span> <span class="identifier">arg2</span> <span class="special">+</span> <span class="special">(</span><span class="number">3</span> <span class="special">*</span> <span class="identifier">arg3</span><span class="special">)</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">[</span><span class="identifier">arg2</span><span class="special">]</span> <span class="comment">// assuming arg1 is indexable and arg2 is a valid index</span>
-</pre>
-<p>
-        Note the expression: <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
-        <span class="identifier">arg3</span></code>. This expression is actually
-        a short-hand equivalent to: <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
-        <span class="special">*</span> <span class="identifier">arg3</span></code>.
-        In most cases, like above, you can get away with it. But in some cases, you
-        will have to explicitly wrap your values in <code class="computeroutput"><span class="identifier">val</span></code>.
-        Rules of thumb:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            In a binary expression (e.g. <code class="computeroutput"><span class="number">3</span>
-            <span class="special">*</span> <span class="identifier">arg3</span></code>),
-            at least one of the operands must be a phoenix primitive or expression.
-          </li>
-<li class="listitem">
-            In a unary expression (e.g. <code class="computeroutput"><span class="identifier">arg1</span><span class="special">++</span></code>), the single operand must be a phoenix
-            primitive or expression.
-          </li>
-</ul></div>
-<p>
-        If these basic rules are not followed, the result is either an error, or
-        is immediately evaluated. Some examples:
-      </p>
-<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="number">123</span>    <span class="comment">// lazy</span>
-<span class="identifier">x</span> <span class="special">=</span> <span class="number">123</span>         <span class="comment">// immediate</span>
-
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="number">0</span><span class="special">]</span>       <span class="comment">// lazy</span>
-<span class="identifier">x</span><span class="special">[</span><span class="number">0</span><span class="special">]</span>            <span class="comment">// immediate</span>
-
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)]</span>  <span class="comment">// lazy</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="identifier">i</span><span class="special">]</span>       <span class="comment">// lazy (equivalent to ref(x)[val(i)])</span>
-<span class="identifier">x</span><span class="special">[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)]</span>       <span class="comment">// illegal (x is not a phoenix primitive or expression)</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)])</span>  <span class="comment">// illegal (x is not a phoenix primitive or expression)</span>
-</pre>
-<p>
-        Why are the last two expression illegal? Although <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> looks as much like a binary operator as
-        <code class="computeroutput"><span class="keyword">operator</span><span class="special">=</span></code>
-        above it; the difference is that the former must be a member (i.e. <code class="computeroutput"><span class="identifier">x</span></code> must have an <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> that takes a phoenix primitive or expression
-        as its argument). This will most likely not be the case.
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about operators <a class="link" href="../modules/operator.html" title="Operator">here.</a>
-      </p>
-</div>
-<h5>
-<a name="phoenix.starter_kit.lazy_operators.h0"></a>
-        <span><a name="phoenix.starter_kit.lazy_operators.first_practical_example"></a></span><a class="link" href="lazy_operators.html#phoenix.starter_kit.lazy_operators.first_practical_example">First
-        Practical Example</a>
-      </h5>
-<p>
-        We've covered enough ground to present a real world example. We want to find
-        the first odd number in an STL container. Normally we use a functor (function
-        object) or a function pointer and pass that in to STL's <code class="computeroutput"><span class="identifier">find_if</span></code>
-        generic function:
-      </p>
-<p>
-        Write a function:
-      </p>
-<pre class="programlisting"><span class="keyword">bool</span>
-<span class="identifier">is_odd</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">arg1</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="keyword">return</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-        Pass a pointer to the function to STL's <code class="computeroutput"><span class="identifier">find_if</span></code>
-        algorithm:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="special">&amp;</span><span class="identifier">is_odd</span><span class="special">)</span>
-</pre>
-<p>
-        Using Phoenix, the same can be achieved directly with a one-liner:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
-</pre>
-<p>
-        The expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
-        <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> automagically creates a functor with the
-        expected behavior. In FP, this unnamed function is called a lambda function.
-        Unlike the function pointer version, which is monomorphic (expects and works
-        only with a fixed type int argument), the Phoenix version is fully polymorphic
-        and works with any container (of ints, of longs, of bignum, etc.) as long
-        as its elements can handle the <code class="computeroutput"><span class="identifier">arg1</span>
-        <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> expression.
-      </p>
-<p>
-        (See find_if.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> ...<span class="bold"><strong>That's it, we're done</strong></span>.
-        Well if you wish to know a little bit more, read on...
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="arguments.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lazy_statements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/lazy_statements.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,72 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Lazy Statements</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="lazy_operators.html" title="Lazy Operators">
-<link rel="next" href="construct__new__delete__casts.html" title="Construct, New, Delete, Casts">
-</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="lazy_operators.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_statements"></a><a class="link" href="lazy_statements.html" title="Lazy Statements">Lazy Statements</a>
-</h3></div></div></div>
-<p>
-        Lazy statements? Sure. There are lazy versions of the C++ statements we all
-        know and love. For example:
-      </p>
-<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">&gt;</span> <span class="number">5</span><span class="special">)</span>
-<span class="special">[</span>
-    <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span>
-<span class="special">]</span>
-</pre>
-<p>
-        Say, for example, we wish to print all the elements that are greater than
-        5 (separated by a comma) in a vector. Here's how we write it:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">v</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">v</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
-    <span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">&gt;</span> <span class="number">5</span><span class="special">)</span>
-    <span class="special">[</span>
-        <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">arg1</span> <span class="special">&lt;&lt;</span> <span class="string">", "</span>
-    <span class="special">]</span>
-<span class="special">);</span>
-</pre>
-<p>
-        (See if.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about statements <a class="link" href="../modules/statement.html" title="Statement">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_operators.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="construct__new__delete__casts.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/more.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,58 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>More</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="lazy_functions.html" title="Lazy Functions">
-<link rel="next" href="../basics.html" title="Basics">
-</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="lazy_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../basics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.more"></a><a class="link" href="more.html" title="More">More</a>
-</h3></div></div></div>
-<p>
-        As mentioned earlier, this chapter is not a thorough discourse of the library.
-        It is meant only to cover enough ground to get you into high gear as quickly
-        as possible. Some advanced stuff is not discussed here (e.g. <a class="link" href="../modules/scope.html" title="Scope">Scopes</a>);
-        nor are features that provide alternative (short-hand) ways to do the same
-        things (e.g. <a class="link" href="../modules/bind.html" title="Bind">Bind</a> vs. <a class="link" href="../modules/function.html" title="Function">Lazy
-        Functions</a>).
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> ...<span class="bold"><strong>If you still wish to learn
-        more, the read on...</strong></span>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="lazy_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../basics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/references.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,73 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>References</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="values.html" title="Values">
-<link rel="next" href="arguments.html" title="Arguments">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.references"></a><a class="link" href="references.html" title="References">References</a>
-</h3></div></div></div>
-<p>
-        References are functions. They hold a reference to a value stored somewhere.
-        For example, given:
-      </p>
-<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
-<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
-</pre>
-<p>
-        we create <code class="computeroutput"><span class="identifier">references</span></code> to
-        <code class="computeroutput"><span class="identifier">i</span></code> and <code class="computeroutput"><span class="identifier">s</span></code>
-        this way:
-      </p>
-<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span>
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">s</span><span class="special">)</span>
-</pre>
-<p>
-        Like <code class="computeroutput"><span class="identifier">val</span></code>, the expressions
-        above evaluates to a nullary function; the first one returning an <code class="computeroutput"><span class="keyword">int</span><span class="special">&amp;</span></code>,
-        and the second one returning a <code class="computeroutput"><span class="keyword">char</span>
-        <span class="keyword">const</span><span class="special">*&amp;</span></code>.
-      </p>
-<p>
-        (See references.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about references <a class="link" href="../modules/core/references.html" title="References">here.</a>
-      </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="values.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="arguments.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/starter_kit/values.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,116 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Values</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../starter_kit.html" title="Starter Kit">
-<link rel="prev" href="../starter_kit.html" title="Starter Kit">
-<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="../starter_kit.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.values"></a><a class="link" href="values.html" title="Values">Values</a>
-</h3></div></div></div>
-<p>
-        Values are functions! Examples:
-      </p>
-<pre class="programlisting"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
-<span class="identifier">val</span><span class="special">(</span><span class="string">"Hello, World"</span><span class="special">)</span>
-</pre>
-<p>
-        The first evaluates to a nullary function (a function taking no arguments)
-        that returns an <code class="computeroutput"><span class="keyword">int</span></code>, <code class="computeroutput"><span class="number">3</span></code>. The second evaluates to a nullary function
-        that returns a <code class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">(&amp;)[</span><span class="number">13</span><span class="special">]</span></code>, <code class="computeroutput"><span class="string">"Hello,
-        World"</span></code>.
-      </p>
-<h5>
-<a name="phoenix.starter_kit.values.h0"></a>
-        <span><a name="phoenix.starter_kit.values.lazy_evaluation"></a></span><a class="link" href="values.html#phoenix.starter_kit.values.lazy_evaluation">Lazy
-        Evaluation</a>
-      </h5>
-<p>
-        Confused? <code class="computeroutput"><span class="identifier">val</span></code> is a unary
-        function and <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code> invokes
-        it, you say? Yes. However, read carefully: <span class="emphasis"><em>"evaluates to a
-        nullary function"</em></span>. <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
-        evaluates to (returns) a nullary function. Aha! <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
-        returns a function! So, since <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
-        returns a function, you can invoke it. Example:
-      </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
-</pre>
-<p>
-        (See values.cpp)
-      </p>
-<div class="sidebar">
-<div class="titlepage"></div>
-<p>
-        <span class="inlinemediaobject"><img src="../../images/tip.png" alt="tip"></span> Learn more about values <a class="link" href="../modules/core/values.html" title="Values">here.</a>
-      </p>
-</div>
-<p>
-        The second function call (the one with no arguments) calls the nullary function
-        which then returns <code class="computeroutput"><span class="number">3</span></code>. The need
-        for a second function call is the reason why the function is said to be
-        <span class="bold"><strong><span class="emphasis"><em>Lazily Evaluated</em></span></strong></span>. The
-        first call doesn't do anything. You need a second call to finally evaluate
-        the thing. The first call lazily evaluates the function; i.e. doesn't do
-        anything and defers the evaluation for later.
-      </p>
-<h5>
-<a name="phoenix.starter_kit.values.h1"></a>
-        <span><a name="phoenix.starter_kit.values.callbacks"></a></span><a class="link" href="values.html#phoenix.starter_kit.values.callbacks">Callbacks</a>
-      </h5>
-<p>
-        It may not be immediately apparent how lazy evaluation can be useful by just
-        looking at the example above. Putting the first and second function call
-        in a single line is really not very useful. However, thinking of <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code> as a callback function (and in most cases
-        they are actually used that way), will make it clear. Example:
-      </p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">F</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">print</span><span class="special">(</span><span class="identifier">F</span> <span class="identifier">f</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">f</span><span class="special">()</span> <span class="special">&lt;&lt;</span> <span class="identifier">endl</span><span class="special">;</span>
-<span class="special">}</span>
-
-<span class="keyword">int</span>
-<span class="identifier">main</span><span class="special">()</span>
-<span class="special">{</span>
-    <span class="identifier">print</span><span class="special">(</span><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">));</span>
-    <span class="identifier">print</span><span class="special">(</span><span class="identifier">val</span><span class="special">(</span><span class="string">"Hello World"</span><span class="special">));</span>
-    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
-<span class="special">}</span>
-</pre>
-<p>
-        (See callback.cpp)
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../starter_kit.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../starter_kit.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,44 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>What's New</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="next" href="what_s_new/phoenix_3_0.html" title="Phoenix 3.0">
-</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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.what_s_new"></a><a class="link" href="what_s_new.html" title="What's New">What's New</a>
-</h2></div></div></div>
-<div class="toc"><dl><dt><span class="section">Phoenix 3.0</span></dt></dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="what_s_new/phoenix_3_0.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/what_s_new/phoenix_3_0.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,67 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Phoenix 3.0</title>
-<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../what_s_new.html" title="What's New">
-<link rel="prev" href="../what_s_new.html" title="What's New">
-<link rel="next" href="../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="p" href="../what_s_new.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../what_s_new.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.what_s_new.phoenix_3_0"></a><a class="link" href="phoenix_3_0.html" title="Phoenix 3.0">Phoenix 3.0</a>
-</h3></div></div></div>
-<p>
-        This is the first official release of Phoenix as first class Boost citizen.
-        As a consequence of the review of Phoenix V2 the internals got completely
-        rewritten. Therefore the internal extension mechanism is different.
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            composite&lt;...&gt;, as_composite&lt;...&gt; and compose are gone and
-            have been replaced. For an in depth discussion see the section <a class="link" href="../inside.html" title="Inside Phoenix">Inside Phoenix</a>
-          </li>
-<li class="listitem">
-            <a class="link" href="../modules/function.html" title="Function">phoenix.modules.function</a>
-            phoenix::function now supports function objects that implement the <a href="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of" target="_top">Boost.Result
-            Of</a> protocol. <span class="bold"><strong>This is a breaking change</strong></span>
-          </li>
-<li class="listitem">
-            Boilerplate macros to easily adapt already existing functions and function
-            objects
-          </li>
-<li class="listitem">
-            <a class="link" href="../modules/bind.html" title="Bind">Bind</a> is no completely compatible
-            with Boost.Bind
-          </li>
-</ul></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../what_s_new.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../what_s_new.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Deleted: website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html
==============================================================================
--- website/public_html/beta/doc/libs/1_50_0/libs/phoenix/doc/html/phoenix/wrap_up.html	2012-09-26 16:09:06 EDT (Wed, 26 Sep 2012)
+++ (empty file)
@@ -1,76 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Wrap Up</title>
-<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Phoenix 3.0">
-<link rel="prev" href="examples/transforming_the_expression_tree.html" title="Transforming the Expression Tree">
-<link rel="next" href="acknowledgments.html" title="Acknowledgments">
-</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/transforming_the_expression_tree.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgments.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.wrap_up"></a><a class="link" href="wrap_up.html" title="Wrap Up">Wrap Up</a>
-</h2></div></div></div>
-<p>
-      Sooner or later more FP techniques become standard practice as people find
-      the true value of this programming discipline outside the academe and into
-      the mainstream. In as much as structured programming of the 70s and object
-      oriented programming in the 80s and generic programming in the 90s shaped our
-      thoughts towards a more robust sense of software engineering, FP will certainly
-      be a paradigm that will catapult us towards more powerful software design and
-      engineering onward into the new millennium.
-    </p>
-<p>
-      Let me quote Doug Gregor of Boost.org. About functional style programming libraries:
-    </p>
-<div class="blockquote"><blockquote class="blockquote"><p>
-        <span class="emphasis"><em>They're gaining acceptance, but are somewhat stunted by the ubiquitousness
-        of broken compilers. The C++ community is moving deeper into the so-called
-        "STL- style" programming paradigm, which brings many aspects of
-        functional programming into the fold. Look at, for instance, the Spirit parser
-        to see how such function objects can be used to build Yacc-like grammars
-        with semantic actions that can build abstract syntax trees on the fly. This
-        type of functional composition is gaining momentum.</em></span>
-      </p></blockquote></div>
-<p>
-      Indeed. Phoenix is another attempt to introduce more FP techniques into the
-      mainstream. Not only is it a tool that will make life easier for the programmer.
-      In its own right, the actual design of the library itself is a model of true
-      C++ FP in action. The library is designed and structured in a strict but clear
-      and well mannered FP sense. By all means, use the library as a tool. But for
-      those who want to learn more about FP in C++, don't stop there, I invite you
-      to take a closer look at the design of the library itself.
-    </p>
-<p>
-      So there you have it. Have fun! See you in the FP world.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2002-2005, 2010 Joel de Guzman, Dan Marsden, Thomas Heller<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="examples/transforming_the_expression_tree.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgments.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk